Base | Representation |
---|---|
bin | 10111001101110010000101… |
… | …111101010011100001110010 |
3 | 111101111212122120022101221202 |
4 | 113031302011331103201302 |
5 | 101340320311230013020 |
6 | 1001053035134451202 |
7 | 30335432642260412 |
oct | 2715620575234162 |
9 | 441455576271852 |
10 | 102102210001010 |
11 | 2a59533882357a |
12 | b550113663b02 |
13 | 44c827401054b |
14 | 1b2dab8044642 |
15 | bc0da5a2be75 |
hex | 5cdc85f53872 |
102102210001010 has 16 divisors (see below), whose sum is σ = 187694275406976. Its totient is φ = 39971929021488.
The previous prime is 102102210000997. The next prime is 102102210001013. The reversal of 102102210001010 is 10100012201201.
It is a super-2 number, since 2×1021022100010102 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102102210000982 and 102102210001000.
It is not an unprimeable number, because it can be changed into a prime (102102210001013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 108619371872 + ... + 108619372811.
It is an arithmetic number, because the mean of its divisors is an integer number (11730892212936).
Almost surely, 2102102210001010 is an apocalyptic number.
102102210001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102102210001010 is a deficient number, since it is larger than the sum of its proper divisors (85592065405966).
102102210001010 is a wasteful number, since it uses less digits than its factorization.
102102210001010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217238744737.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102102210001010 its reverse (10100012201201), we get a palindrome (112202222202211).
The spelling of 102102210001010 in words is "one hundred two trillion, one hundred two billion, two hundred ten million, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •