Base | Representation |
---|---|
bin | 100000001100001100000… |
… | …110101011000011001101 |
3 | 21211110211211112221010011 |
4 | 200030030012223003031 |
5 | 242220400433430404 |
6 | 4412121352513221 |
7 | 315551115144652 |
oct | 40141406530315 |
9 | 7743754487104 |
10 | 2212111233229 |
11 | 783173137847 |
12 | 2b887b6ab811 |
13 | 1307a7a92831 |
14 | 790d1265c29 |
15 | 3c81e845604 |
hex | 2030c1ab0cd |
2212111233229 has 2 divisors, whose sum is σ = 2212111233230. Its totient is φ = 2212111233228.
The previous prime is 2212111233223. The next prime is 2212111233301. The reversal of 2212111233229 is 9223321112122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1428089530729 + 784021702500 = 1195027^2 + 885450^2 .
It is a cyclic number.
It is not a de Polignac number, because 2212111233229 - 23 = 2212111233221 is a prime.
It is a super-2 number, since 2×22121112332292 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2212111233229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2212111233221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1106055616614 + 1106055616615.
It is an arithmetic number, because the mean of its divisors is an integer number (1106055616615).
Almost surely, 22212111233229 is an apocalyptic number.
It is an amenable number.
2212111233229 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212111233229 is an equidigital number, since it uses as much as digits as its factorization.
2212111233229 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5184, while the sum is 31.
The spelling of 2212111233229 in words is "two trillion, two hundred twelve billion, one hundred eleven million, two hundred thirty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •