Base | Representation |
---|---|
bin | 100000001100001100000… |
… | …101111010001010110101 |
3 | 21211110211211011202110202 |
4 | 200030030011322022311 |
5 | 242220400411024023 |
6 | 4412121344330245 |
7 | 315551113352150 |
oct | 40141405721265 |
9 | 7743754152422 |
10 | 2212111033013 |
11 | 783173010382 |
12 | 2b887b613985 |
13 | 1307a7a2266b |
14 | 790d1212c97 |
15 | 3c81e806128 |
hex | 2030c17a2b5 |
2212111033013 has 8 divisors (see below), whose sum is σ = 2528194624128. Its totient is φ = 1896044374224.
The previous prime is 2212111033003. The next prime is 2212111033019. The reversal of 2212111033013 is 3103301112122.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2212111033013 - 216 = 2212110967477 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2212111033019) 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 7 ways as a sum of consecutive naturals, for example, 3951881 + ... + 4476782.
It is an arithmetic number, because the mean of its divisors is an integer number (316024328016).
Almost surely, 22212111033013 is an apocalyptic number.
It is an amenable number.
2212111033013 is a deficient number, since it is larger than the sum of its proper divisors (316083591115).
2212111033013 is an equidigital number, since it uses as much as digits as its factorization.
2212111033013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8466163.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 2212111033013 its reverse (3103301112122), we get a palindrome (5315412145135).
The spelling of 2212111033013 in words is "two trillion, two hundred twelve billion, one hundred eleven million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •