Base | Representation |
---|---|
bin | 10111001101110001111001… |
… | …011100101000100110110001 |
3 | 111101111212002221100211121200 |
4 | 113031301321130220212301 |
5 | 101340314344012010001 |
6 | 1001053002240041413 |
7 | 30335424513236313 |
oct | 2715617134504661 |
9 | 441455087324550 |
10 | 102102000110001 |
11 | 2a5952402a5331 |
12 | b550075303269 |
13 | 44c823c6a2198 |
14 | 1b2da982097b3 |
15 | bc0d923bc086 |
hex | 5cdc797289b1 |
102102000110001 has 24 divisors (see below), whose sum is σ = 156189778255680. Its totient is φ = 64136752818336.
The previous prime is 102102000109943. The next prime is 102102000110053. The reversal of 102102000110001 is 100011000201201.
It is a happy number.
It is not a de Polignac number, because 102102000110001 - 217 = 102101999978929 is a prime.
It is a super-2 number, since 2×1021020001100012 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (102102000110801) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3680929246 + ... + 3680956983.
It is an arithmetic number, because the mean of its divisors is an integer number (6507907427320).
Almost surely, 2102102000110001 is an apocalyptic number.
It is an amenable number.
102102000110001 is a deficient number, since it is larger than the sum of its proper divisors (54087778145679).
102102000110001 is a wasteful number, since it uses less digits than its factorization.
102102000110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7361886325 (or 7361886322 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102102000110001 its reverse (100011000201201), we get a palindrome (202113000311202).
The spelling of 102102000110001 in words is "one hundred two trillion, one hundred two billion, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •