Base | Representation |
---|---|
bin | 10111001101110000001110… |
… | …001001110110000001101000 |
3 | 111101111200110111011220021011 |
4 | 113031300032021312001220 |
5 | 101340302202201201440 |
6 | 1001052103453553304 |
7 | 30335332064604556 |
oct | 2715601611660150 |
9 | 441450414156234 |
10 | 102100200022120 |
11 | 2a5944a71906a3 |
12 | b54b8524a5834 |
13 | 44c8013781121 |
14 | 1b2d96710cbd6 |
15 | bc0cd93479ea |
hex | 5cdc0e276068 |
102100200022120 has 32 divisors (see below), whose sum is σ = 229729110786720. Its totient is φ = 40839429211200.
The previous prime is 102100200022081. The next prime is 102100200022141. The reversal of 102100200022120 is 21220002001201.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 102100200022120.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17791962 + ... + 22820041.
It is an arithmetic number, because the mean of its divisors is an integer number (7179034712085).
Almost surely, 2102100200022120 is an apocalyptic number.
102100200022120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102100200022120 is an abundant number, since it is smaller than the sum of its proper divisors (127628910764600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100200022120 is a wasteful number, since it uses less digits than its factorization.
102100200022120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40674865 (or 40674861 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102100200022120 its reverse (21220002001201), we get a palindrome (123320202023321).
The spelling of 102100200022120 in words is "one hundred two trillion, one hundred billion, two hundred million, twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •