Base | Representation |
---|---|
bin | 10111001101110000000011… |
… | …100011100101110010110000 |
3 | 111101111200000002121201100112 |
4 | 113031300003203211302300 |
5 | 101340301321142101000 |
6 | 1001052034103040452 |
7 | 30335324505411065 |
oct | 2715600343456260 |
9 | 441450002551315 |
10 | 102100022222000 |
11 | 2a594415890850 |
12 | b54b802a40128 |
13 | 44c7cb599a65a |
14 | 1b2d94b668c6c |
15 | bc0cc8926235 |
hex | 5cdc038e5cb0 |
102100022222000 has 320 divisors, whose sum is σ = 273344781385728. Its totient is φ = 36573505920000.
The previous prime is 102100022221991. The next prime is 102100022222063. The reversal of 102100022222000 is 222220001201.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1894679057 + ... + 1894732943.
Almost surely, 2102100022222000 is an apocalyptic number.
102100022222000 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 102100022222000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136672390692864).
102100022222000 is an abundant number, since it is smaller than the sum of its proper divisors (171244759163728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100022222000 is a wasteful number, since it uses less digits than its factorization.
102100022222000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55205 (or 55189 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 102100022222000 its reverse (222220001201), we get a palindrome (102322242223201).
The spelling of 102100022222000 in words is "one hundred two trillion, one hundred billion, twenty-two million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •