Base | Representation |
---|---|
bin | 1001010001101110000000… |
… | …0010000101000011110101 |
3 | 1100010010000022012220101000 |
4 | 2110123200002011003311 |
5 | 2314104110304031401 |
6 | 33405453110553513 |
7 | 2101632531663354 |
oct | 224334002050365 |
9 | 40103008186330 |
10 | 10200011002101 |
11 | 328288932a268 |
12 | 11889b7068899 |
13 | 58cb1a82a3cb |
14 | 27397c87599b |
15 | 12a4d433c186 |
hex | 946e00850f5 |
10200011002101 has 64 divisors (see below), whose sum is σ = 15934773657600. Its totient is φ = 6438897619200.
The previous prime is 10200011002079. The next prime is 10200011002117. The reversal of 10200011002101 is 10120011000201.
It is a happy number.
It is not a de Polignac number, because 10200011002101 - 29 = 10200011001589 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200011002121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 154136461 + ... + 154202621.
It is an arithmetic number, because the mean of its divisors is an integer number (248980838400).
Almost surely, 210200011002101 is an apocalyptic number.
It is an amenable number.
10200011002101 is a deficient number, since it is larger than the sum of its proper divisors (5734762655499).
10200011002101 is a wasteful number, since it uses less digits than its factorization.
10200011002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70167 (or 70161 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10200011002101 its reverse (10120011000201), we get a palindrome (20320022002302).
The spelling of 10200011002101 in words is "ten trillion, two hundred billion, eleven million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •