Base | Representation |
---|---|
bin | 10111001100011101001001… |
… | …100010110110111101111111 |
3 | 111101012011020010121002110220 |
4 | 113030131021202312331333 |
5 | 101332322013020401421 |
6 | 1000543112445232423 |
7 | 30326023505142135 |
oct | 2714351142667577 |
9 | 441164203532426 |
10 | 102011002122111 |
11 | 2a55a694305165 |
12 | b5364ba262713 |
13 | 44bc799b98834 |
14 | 1b29504965755 |
15 | bbd81860a3c6 |
hex | 5cc7498b6f7f |
102011002122111 has 8 divisors (see below), whose sum is σ = 136024772400000. Its totient is φ = 68002283296152.
The previous prime is 102011002122047. The next prime is 102011002122149. The reversal of 102011002122111 is 111221200110201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102011002122111 - 26 = 102011002122047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011002122181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1262815861 + ... + 1262896638.
It is an arithmetic number, because the mean of its divisors is an integer number (17003096550000).
Almost surely, 2102011002122111 is an apocalyptic number.
102011002122111 is a deficient number, since it is larger than the sum of its proper divisors (34013770277889).
102011002122111 is a wasteful number, since it uses less digits than its factorization.
102011002122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2525725965.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102011002122111 its reverse (111221200110201), we get a palindrome (213232202232312).
The spelling of 102011002122111 in words is "one hundred two trillion, eleven billion, two million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •