Base | Representation |
---|---|
bin | 11011010011111111011011… |
… | …011100011001100011000100 |
3 | 120202022110101020212210202210 |
4 | 123103333123130121203010 |
5 | 111221030333144202322 |
6 | 1103250501301103420 |
7 | 34205313103330524 |
oct | 3323773334314304 |
9 | 522273336783683 |
10 | 120121032022212 |
11 | 35302053033951 |
12 | 115803166b7b70 |
13 | 5204498383770 |
14 | 2193c6349b684 |
15 | dd495501570c |
hex | 6d3fdb7198c4 |
120121032022212 has 24 divisors (see below), whose sum is σ = 301842593286976. Its totient is φ = 36960317545248.
The previous prime is 120121032022207. The next prime is 120121032022213. The reversal of 120121032022212 is 212220230121021.
It is a super-2 number, since 2×1201210320222122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (120121032022213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 385003307608 + ... + 385003307919.
Almost surely, 2120121032022212 is an apocalyptic number.
120121032022212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
120121032022212 is an abundant number, since it is smaller than the sum of its proper divisors (181721561264764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120121032022212 is a wasteful number, since it uses less digits than its factorization.
120121032022212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 770006615547 (or 770006615545 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 120121032022212 its reverse (212220230121021), we get a palindrome (332341262143233).
The spelling of 120121032022212 in words is "one hundred twenty trillion, one hundred twenty-one billion, thirty-two million, twenty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •