Base | Representation |
---|---|
bin | 100000001100000101110… |
… | …111101111011010011001 |
3 | 21211110120112202211122011 |
4 | 200030011313233122121 |
5 | 242220142200440031 |
6 | 4412103135225521 |
7 | 315545405226016 |
oct | 40140567573231 |
9 | 7743515684564 |
10 | 2212006655641 |
11 | 78311a0aa092 |
12 | 2b88506782a1 |
13 | 13078c2085c3 |
14 | 790c140270d |
15 | 3c8155896b1 |
hex | 20305def699 |
2212006655641 has 2 divisors, whose sum is σ = 2212006655642. Its totient is φ = 2212006655640.
The previous prime is 2212006655627. The next prime is 2212006655647. The reversal of 2212006655641 is 1465566002122.
It is a happy number.
2212006655641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1118737751616 + 1093268904025 = 1057704^2 + 1045595^2 .
It is a cyclic number.
It is not a de Polignac number, because 2212006655641 - 25 = 2212006655609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2212006655594 and 2212006655603.
It is not a weakly prime, because it can be changed into another prime (2212006655647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1106003327820 + 1106003327821.
It is an arithmetic number, because the mean of its divisors is an integer number (1106003327821).
Almost surely, 22212006655641 is an apocalyptic number.
It is an amenable number.
2212006655641 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212006655641 is an equidigital number, since it uses as much as digits as its factorization.
2212006655641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 172800, while the sum is 40.
The spelling of 2212006655641 in words is "two trillion, two hundred twelve billion, six million, six hundred fifty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •