Base | Representation |
---|---|
bin | 10110110010000111011110… |
… | …001101011000110110101011 |
3 | 111010210010100101002122221000 |
4 | 112302013132031120312223 |
5 | 101113143142121200021 |
6 | 553035414013050043 |
7 | 30051166454613615 |
oct | 2662073615306653 |
9 | 433703311078830 |
10 | 100201020100011 |
11 | 29a2201767a636 |
12 | b2a3766a86923 |
13 | 43babb98bc09c |
14 | 1aa5a80593db5 |
15 | b8b6d2595b26 |
hex | 5b21de358dab |
100201020100011 has 32 divisors (see below), whose sum is σ = 151037282707200. Its totient is φ = 65639555625600.
The previous prime is 100201020099991. The next prime is 100201020100079. The reversal of 100201020100011 is 110001020102001.
It is a happy number.
It is not a de Polignac number, because 100201020100011 - 27 = 100201020099883 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 = 100201020099966 and 100201020100002.
It is not an unprimeable number, because it can be changed into a prime (100201020104011) 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, 68339781 + ... + 69790598.
It is an arithmetic number, because the mean of its divisors is an integer number (4719915084600).
Almost surely, 2100201020100011 is an apocalyptic number.
100201020100011 is a deficient number, since it is larger than the sum of its proper divisors (50836262607189).
100201020100011 is a wasteful number, since it uses less digits than its factorization.
100201020100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138130856 (or 138130850 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100201020100011 its reverse (110001020102001), we get a palindrome (210202040202012).
The spelling of 100201020100011 in words is "one hundred trillion, two hundred one billion, twenty million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •