| Base | Representation |
|---|---|
| bin | 10111001100011101001001… |
| … | …100011001001111111000000 |
| 3 | 111101012011020010202001022200 |
| 4 | 113030131021203021333000 |
| 5 | 101332322013030400000 |
| 6 | 1000543112451033200 |
| 7 | 30326023505615205 |
| oct | 2714351143117700 |
| 9 | 441164203661280 |
| 10 | 102011002200000 |
| 11 | 2a55a694358733 |
| 12 | b5364ba29b800 |
| 13 | 44bc799bc511a |
| 14 | 1b29504985cac |
| 15 | bbd818623500 |
| hex | 5cc7498c9fc0 |
102011002200000 has 504 divisors, whose sum is σ = 365581780331040. Its totient is φ = 27194745600000.
The previous prime is 102011002199999. The next prime is 102011002200001. The reversal of 102011002200000 is 2200110201.
It is an interprime number because it is at equal distance from previous prime (102011002199999) and next prime (102011002200001).
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 (102011002200001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 8134193730 + ... + 8134206270.
It is an arithmetic number, because the mean of its divisors is an integer number (725360675260).
Almost surely, 2102011002200000 is an apocalyptic number.
102011002200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102011002200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182790890165520).
102011002200000 is an abundant number, since it is smaller than the sum of its proper divisors (263570778131040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011002200000 is an equidigital number, since it uses as much as digits as its factorization.
102011002200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17103 (or 17070 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 102011002200000 its reverse (2200110201), we get a palindrome (102013202310201).
The spelling of 102011002200000 in words is "one hundred two trillion, eleven billion, two million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •