Base | Representation |
---|---|
bin | 100011110100111… |
… | …0000110010111110 |
3 | 10002210000112111102 |
4 | 1013221300302332 |
5 | 4430221130420 |
6 | 315141453102 |
7 | 41534636336 |
oct | 10751606276 |
9 | 3083015442 |
10 | 1202130110 |
11 | 567631165 |
12 | 296711192 |
13 | 16208bbbc |
14 | b59260c6 |
15 | 7080ba75 |
hex | 47a70cbe |
1202130110 has 32 divisors (see below), whose sum is σ = 2197824192. Its totient is φ = 473320960.
The previous prime is 1202130109. The next prime is 1202130119. The reversal of 1202130110 is 110312021.
It is a super-2 number, since 2×12021301102 = 2890233602737224200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1202130091 and 1202130100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1202130119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 692804 + ... + 694536.
It is an arithmetic number, because the mean of its divisors is an integer number (68682006).
Almost surely, 21202130110 is an apocalyptic number.
1202130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1202130110 is a deficient number, since it is larger than the sum of its proper divisors (995694082).
1202130110 is a wasteful number, since it uses less digits than its factorization.
1202130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2788.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1202130110 is about 34671.7480090058. The cubic root of 1202130110 is about 1063.2869696299.
Adding to 1202130110 its reverse (110312021), we get a palindrome (1312442131).
The spelling of 1202130110 in words is "one billion, two hundred two million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •