Base | Representation |
---|---|
bin | 10111000000111101011001… |
… | …110100001101000101001000 |
3 | 111021101122002121100011212221 |
4 | 113000331121310031011020 |
5 | 101231401102241401440 |
6 | 555140141434143424 |
7 | 30214655524345465 |
oct | 2700753164150510 |
9 | 437348077304787 |
10 | 101221001122120 |
11 | 2a285649342140 |
12 | b429384581b74 |
13 | 446313a649419 |
14 | 1add1a058266c |
15 | ba7ecd079d4a |
hex | 5c0f59d0d148 |
101221001122120 has 64 divisors (see below), whose sum is σ = 248457250895040. Its totient is φ = 36806791929600.
The previous prime is 101221001122099. The next prime is 101221001122201. The reversal of 101221001122120 is 21221100122101.
It is a junction number, because it is equal to n+sod(n) for n = 101221001122094 and 101221001122103.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16712355 + ... + 21948685.
It is an arithmetic number, because the mean of its divisors is an integer number (3882144545235).
Almost surely, 2101221001122120 is an apocalyptic number.
101221001122120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101221001122120 is an abundant number, since it is smaller than the sum of its proper divisors (147236249772920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101221001122120 is a wasteful number, since it uses less digits than its factorization.
101221001122120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5280286 (or 5280282 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101221001122120 its reverse (21221100122101), we get a palindrome (122442101244221).
The spelling of 101221001122120 in words is "one hundred one trillion, two hundred twenty-one billion, one million, one hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •