Base | Representation |
---|---|
bin | 10001110010001100110… |
… | …011111010101110110101 |
3 | 11022211112120002201111222 |
4 | 101302030303322232311 |
5 | 130010412040212323 |
6 | 2333235030240125 |
7 | 154203412136210 |
oct | 21621463725665 |
9 | 4284476081458 |
10 | 1222133132213 |
11 | 4313383239a4 |
12 | 178a35ab6045 |
13 | 8b328bb1046 |
14 | 43219c42777 |
15 | 21bccd659c8 |
hex | 11c8ccfabb5 |
1222133132213 has 8 divisors (see below), whose sum is σ = 1400314131840. Its totient is φ = 1044849770640.
The previous prime is 1222133132203. The next prime is 1222133132249. The reversal of 1222133132213 is 3122313312221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1222133132213 - 28 = 1222133131957 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222133132203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 224406593 + ... + 224412038.
It is an arithmetic number, because the mean of its divisors is an integer number (175039266480).
Almost surely, 21222133132213 is an apocalyptic number.
It is an amenable number.
1222133132213 is a deficient number, since it is larger than the sum of its proper divisors (178180999627).
1222133132213 is an equidigital number, since it uses as much as digits as its factorization.
1222133132213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448819027.
The product of its digits is 2592, while the sum is 26.
Adding to 1222133132213 its reverse (3122313312221), we get a palindrome (4344446444434).
The spelling of 1222133132213 in words is "one trillion, two hundred twenty-two billion, one hundred thirty-three million, one hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •