Base | Representation |
---|---|
bin | 1001010010011010101111… |
… | …1100110111001010100000 |
3 | 1100011021000101020222010222 |
4 | 2110212223330313022200 |
5 | 2314303210130333440 |
6 | 33415201014542212 |
7 | 2102536266550151 |
oct | 224465374671240 |
9 | 40137011228128 |
10 | 10212022121120 |
11 | 3287992295806 |
12 | 118b1a9667968 |
13 | 590cb3085c21 |
14 | 27439bb49928 |
15 | 12a988a572b5 |
hex | 949abf372a0 |
10212022121120 has 72 divisors (see below), whose sum is σ = 25462517488884. Its totient is φ = 3869818887168.
The previous prime is 10212022121089. The next prime is 10212022121131. The reversal of 10212022121120 is 2112122021201.
10212022121120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10127338793104 + 84683328016 = 3182348^2 + 291004^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 88342709 + ... + 88458228.
Almost surely, 210212022121120 is an apocalyptic number.
10212022121120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10212022121120 is an abundant number, since it is smaller than the sum of its proper divisors (15250495367764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212022121120 is a wasteful number, since it uses less digits than its factorization.
10212022121120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176800990 (or 176800963 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 10212022121120 its reverse (2112122021201), we get a palindrome (12324144142321).
The spelling of 10212022121120 in words is "ten trillion, two hundred twelve billion, twenty-two million, one hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •