Base | Representation |
---|---|
bin | 10110110000101001100100… |
… | …111011110011100110001011 |
3 | 111010102111010010112220001200 |
4 | 112300221210323303212023 |
5 | 101110020203001400021 |
6 | 552521221514115243 |
7 | 30041000205243555 |
oct | 2660514473634613 |
9 | 433374103486050 |
10 | 100100201200011 |
11 | 29993290a74881 |
12 | b28810aa1bb23 |
13 | 43b154053cc3c |
14 | 1aa0c388884d5 |
15 | b88c814ee126 |
hex | 5b0a64ef398b |
100100201200011 has 24 divisors (see below), whose sum is σ = 144920798880000. Its totient is φ = 66580417117872.
The previous prime is 100100201200001. The next prime is 100100201200039. The reversal of 100100201200011 is 110002102001001.
It is a happy number.
It is not a de Polignac number, because 100100201200011 - 25 = 100100201199979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100100201199966 and 100100201200002.
It is not an unprimeable number, because it can be changed into a prime (100100201200001) 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, 318289480 + ... + 318603818.
It is an arithmetic number, because the mean of its divisors is an integer number (6038366620000).
Almost surely, 2100100201200011 is an apocalyptic number.
100100201200011 is a deficient number, since it is larger than the sum of its proper divisors (44820597679989).
100100201200011 is a wasteful number, since it uses less digits than its factorization.
100100201200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395383 (or 395380 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100100201200011 its reverse (110002102001001), we get a palindrome (210102303201012).
The spelling of 100100201200011 in words is "one hundred trillion, one hundred billion, two hundred one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •