Base | Representation |
---|---|
bin | 10001110000011010010… |
… | …011110011001010111100 |
3 | 11022122120200100200110120 |
4 | 101300122103303022330 |
5 | 124442443300010022 |
6 | 2332320244134540 |
7 | 154104664542330 |
oct | 21603223631274 |
9 | 4278520320416 |
10 | 1220212110012 |
11 | 430541a1a545 |
12 | 17859a697450 |
13 | 8b0b0bc9a0c |
14 | 430b6a657c0 |
15 | 21b193a3d5c |
hex | 11c1a4f32bc |
1220212110012 has 48 divisors (see below), whose sum is σ = 3341842183680. Its totient is φ = 339209543232.
The previous prime is 1220212109999. The next prime is 1220212110017. The reversal of 1220212110012 is 2100112120221.
It is a junction number, because it is equal to n+sod(n) for n = 1220212109973 and 1220212110000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220212110017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 196298712 + ... + 196304927.
It is an arithmetic number, because the mean of its divisors is an integer number (69621712160).
Almost surely, 21220212110012 is an apocalyptic number.
1220212110012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1220212110012 is an abundant number, since it is smaller than the sum of its proper divisors (2121630073668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220212110012 is a wasteful number, since it uses less digits than its factorization.
1220212110012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 392603690 (or 392603688 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1220212110012 its reverse (2100112120221), we get a palindrome (3320324230233).
The spelling of 1220212110012 in words is "one trillion, two hundred twenty billion, two hundred twelve million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •