Base | Representation |
---|---|
bin | 10111001101110010000110… |
… | …101011100000000110111000 |
3 | 111101111212200102002122221211 |
4 | 113031302012223200012320 |
5 | 101340320322330024120 |
6 | 1001053040250212504 |
7 | 30335433150226105 |
oct | 2715620653400670 |
9 | 441455612078854 |
10 | 102102222111160 |
11 | 2a595344645067 |
12 | b550117724134 |
13 | 44c827669070b |
14 | 1b2dab98b7aac |
15 | bc0da6b2025a |
hex | 5cdc86ae01b8 |
102102222111160 has 64 divisors (see below), whose sum is σ = 230007837427200. Its totient is φ = 40791525110400.
The previous prime is 102102222111101. The next prime is 102102222111161. The reversal of 102102222111160 is 61111222201201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102102222111161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 110204331 + ... + 111126949.
It is an arithmetic number, because the mean of its divisors is an integer number (3593872459800).
Almost surely, 2102102222111160 is an apocalyptic number.
102102222111160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102102222111160 is an abundant number, since it is smaller than the sum of its proper divisors (127905615316040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102102222111160 is a wasteful number, since it uses less digits than its factorization.
102102222111160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 925972 (or 925968 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 102102222111160 its reverse (61111222201201), we get a palindrome (163213444312361).
The spelling of 102102222111160 in words is "one hundred two trillion, one hundred two billion, two hundred twenty-two million, one hundred eleven thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •