Base | Representation |
---|---|
bin | 10111001111001101001010… |
… | …110000110100111011011011 |
3 | 111101212020001210120001212011 |
4 | 113033031022300310323123 |
5 | 101343421100241401021 |
6 | 1001210010553530351 |
7 | 30345464205136432 |
oct | 2717151260647333 |
9 | 441766053501764 |
10 | 102200001122011 |
11 | 2a622860315141 |
12 | b5670657139b7 |
13 | 450455a0000a0 |
14 | 1b34713996119 |
15 | bc36cad93de1 |
hex | 5cf34ac34edb |
102200001122011 has 32 divisors (see below), whose sum is σ = 117063998392320. Its totient is φ = 88386703317504.
The previous prime is 102200001121969. The next prime is 102200001122027. The reversal of 102200001122011 is 110221100002201.
It is a cyclic number.
It is not a de Polignac number, because 102200001122011 - 215 = 102200001089243 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102200001121982 and 102200001122000.
It is not an unprimeable number, because it can be changed into a prime (102200001122311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1432079016 + ... + 1432150378.
It is an arithmetic number, because the mean of its divisors is an integer number (3658249949760).
Almost surely, 2102200001122011 is an apocalyptic number.
102200001122011 is a deficient number, since it is larger than the sum of its proper divisors (14863997270309).
102200001122011 is a wasteful number, since it uses less digits than its factorization.
102200001122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100675.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102200001122011 its reverse (110221100002201), we get a palindrome (212421101124212).
The spelling of 102200001122011 in words is "one hundred two trillion, two hundred billion, one million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •