Base | Representation |
---|---|
bin | 11101110000000010010… |
… | …11111011010010111000 |
3 | 10121201112102021002110222 |
4 | 32320001023323102320 |
5 | 113222002330320440 |
6 | 2101334035355212 |
7 | 133565421441155 |
oct | 16700113732270 |
9 | 3551472232428 |
10 | 1022222120120 |
11 | 364581812723 |
12 | 146144152b08 |
13 | 7551a14b246 |
14 | 376938c722c |
15 | 1b8cc61d2b5 |
hex | ee012fb4b8 |
1022222120120 has 32 divisors (see below), whose sum is σ = 2300152464000. Its totient is φ = 408861702528.
The previous prime is 1022222120081. The next prime is 1022222120141. The reversal of 1022222120120 is 210212222201.
It is a happy number.
1022222120120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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, 232739 + ... + 1448658.
It is an arithmetic number, because the mean of its divisors is an integer number (71879764500).
Almost surely, 21022222120120 is an apocalyptic number.
1022222120120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022222120120 is an abundant number, since it is smaller than the sum of its proper divisors (1277930343880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022222120120 is a wasteful number, since it uses less digits than its factorization.
1022222120120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1696607 (or 1696603 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 1022222120120 its reverse (210212222201), we get a palindrome (1232434342321).
The spelling of 1022222120120 in words is "one trillion, twenty-two billion, two hundred twenty-two million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •