Base | Representation |
---|---|
bin | 10000010011000110011… |
… | …101110110010001100100 |
3 | 10222001222012111121220220 |
4 | 100103012131312101210 |
5 | 121322300412211322 |
6 | 2214310341324340 |
7 | 143630112130542 |
oct | 20230635662144 |
9 | 3861865447826 |
10 | 1120021210212 |
11 | 3a1aa8857613 |
12 | 161098a066b0 |
13 | 8180499b118 |
14 | 3c2d0510d92 |
15 | 1e20350b55c |
hex | 104c6776464 |
1120021210212 has 24 divisors (see below), whose sum is σ = 2750929288800. Its totient is φ = 353690908416.
The previous prime is 1120021210177. The next prime is 1120021210241. The reversal of 1120021210212 is 2120121200211.
It is a super-2 number, since 2×11200212102122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1120021210191 and 1120021210200.
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, 2456186637 + ... + 2456187092.
It is an arithmetic number, because the mean of its divisors is an integer number (114622053700).
Almost surely, 21120021210212 is an apocalyptic number.
1120021210212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1120021210212 is an abundant number, since it is smaller than the sum of its proper divisors (1630908078588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120021210212 is a wasteful number, since it uses less digits than its factorization.
1120021210212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4912373755 (or 4912373753 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1120021210212 its reverse (2120121200211), we get a palindrome (3240142410423).
The spelling of 1120021210212 in words is "one trillion, one hundred twenty billion, twenty-one million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •