Base | Representation |
---|---|
bin | 11011010011101100111101… |
… | …011111101011010010100000 |
3 | 120202020120012021121002000112 |
4 | 123103230331133223102200 |
5 | 111220214230231241000 |
6 | 1103233421451310452 |
7 | 34204011515613002 |
oct | 3323547537532240 |
9 | 522216167532015 |
10 | 120101202212000 |
11 | 352a46a7686a49 |
12 | 1157850174b428 |
13 | 5202658026659 |
14 | 2192d01a38372 |
15 | dd41941b6235 |
hex | 6d3b3d7eb4a0 |
120101202212000 has 48 divisors (see below), whose sum is σ = 295088653844712. Its totient is φ = 48040480883200.
The previous prime is 120101202211993. The next prime is 120101202212003. The reversal of 120101202212000 is 212202101021.
It can be written as a sum of positive squares in 4 ways, for example, as 35784658992784 + 84316543219216 = 5982028^2 + 9182404^2 .
It is not an unprimeable number, because it can be changed into a prime (120101202212003) 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, 15012646277 + ... + 15012654276.
Almost surely, 2120101202212000 is an apocalyptic number.
120101202212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120101202212000 is an abundant number, since it is smaller than the sum of its proper divisors (174987451632712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120101202212000 is an equidigital number, since it uses as much as digits as its factorization.
120101202212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30025300578 (or 30025300560 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 120101202212000 its reverse (212202101021), we get a palindrome (120313404313021).
The spelling of 120101202212000 in words is "one hundred twenty trillion, one hundred one billion, two hundred two million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •