Base | Representation |
---|---|
bin | 10001110010000101100… |
… | …110101001001110100000 |
3 | 11022211020010120100100022 |
4 | 101302011212221032200 |
5 | 130010140111242003 |
6 | 2333215030413012 |
7 | 154200413263421 |
oct | 21620546511640 |
9 | 4284203510308 |
10 | 1222012212128 |
11 | 431286043944 |
12 | 178a01501168 |
13 | 8b309b243b6 |
14 | 43207b67648 |
15 | 21bc242c738 |
hex | 11c859a93a0 |
1222012212128 has 24 divisors (see below), whose sum is σ = 2446613436960. Its totient is φ = 600650069440.
The previous prime is 1222012212121. The next prime is 1222012212131. The reversal of 1222012212128 is 8212122102221.
It is a junction number, because it is equal to n+sod(n) for n = 1222012212097 and 1222012212106.
It is not an unprimeable number, because it can be changed into a prime (1222012212121) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 323624228 + ... + 323628003.
It is an arithmetic number, because the mean of its divisors is an integer number (101942226540).
Almost surely, 21222012212128 is an apocalyptic number.
It is an amenable number.
1222012212128 is an abundant number, since it is smaller than the sum of its proper divisors (1224601224832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1222012212128 is an equidigital number, since it uses as much as digits as its factorization.
1222012212128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 647252300 (or 647252292 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 26.
Adding to 1222012212128 its reverse (8212122102221), we get a palindrome (9434134314349).
The spelling of 1222012212128 in words is "one trillion, two hundred twenty-two billion, twelve million, two hundred twelve thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •