Base | Representation |
---|---|
bin | 1001010001101110000000… |
… | …0010000101000011111111 |
3 | 1100010010000022012220101101 |
4 | 2110123200002011003333 |
5 | 2314104110304031421 |
6 | 33405453110553531 |
7 | 2101632531663400 |
oct | 224334002050377 |
9 | 40103008186341 |
10 | 10200011002111 |
11 | 328288932a277 |
12 | 11889b70688a7 |
13 | 58cb1a82a408 |
14 | 27397c8759a7 |
15 | 12a4d433c191 |
hex | 946e00850ff |
10200011002111 has 24 divisors (see below), whose sum is σ = 12571729125696. Its totient is φ = 8223045626880.
The previous prime is 10200011002079. The next prime is 10200011002117. The reversal of 10200011002111 is 11120011000201.
It is not a de Polignac number, because 10200011002111 - 25 = 10200011002079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200011002117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2878650 + ... + 5355991.
It is an arithmetic number, because the mean of its divisors is an integer number (523822046904).
Almost surely, 210200011002111 is an apocalyptic number.
10200011002111 is a deficient number, since it is larger than the sum of its proper divisors (2371718123585).
10200011002111 is a wasteful number, since it uses less digits than its factorization.
10200011002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8236159 (or 8236152 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10200011002111 its reverse (11120011000201), we get a palindrome (21320022002312).
The spelling of 10200011002111 in words is "ten trillion, two hundred billion, eleven million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •