Base | Representation |
---|---|
bin | 10001110010001100001… |
… | …001111010101110000000 |
3 | 11022211111210101100111110 |
4 | 101302030021322232000 |
5 | 130010401230401422 |
6 | 2333233554243320 |
7 | 154203216431613 |
oct | 21621411725600 |
9 | 4284453340443 |
10 | 1222122122112 |
11 | 431332093941 |
12 | 178a32286540 |
13 | 8b3268277a8 |
14 | 432185b817a |
15 | 21bcbddd60c |
hex | 11c8c27ab80 |
1222122122112 has 64 divisors (see below), whose sum is σ = 3246414771600. Its totient is φ = 407354855424.
The previous prime is 1222122122101. The next prime is 1222122122129. The reversal of 1222122122112 is 2112212212221.
It is a tau number, because it is divible by the number of its divisors (64).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9771718 + ... + 9895994.
Almost surely, 21222122122112 is an apocalyptic number.
1222122122112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1222122122112 is an abundant number, since it is smaller than the sum of its proper divisors (2024292649488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1222122122112 is a wasteful number, since it uses less digits than its factorization.
1222122122112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149903 (or 149891 counting only the distinct ones).
The product of its digits is 256, while the sum is 21.
Adding to 1222122122112 its reverse (2112212212221), we get a palindrome (3334334334333).
The spelling of 1222122122112 in words is "one trillion, two hundred twenty-two billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •