Base | Representation |
---|---|
bin | 100000010101110101011… |
… | …110000101000100000001 |
3 | 21212110120200100111101202 |
4 | 200111311132011010001 |
5 | 242403104020130421 |
6 | 4420553233510545 |
7 | 316365565023206 |
oct | 40256536050401 |
9 | 7773520314352 |
10 | 2222468911361 |
11 | 7875a8840716 |
12 | 2ba890412455 |
13 | 1317688c3c6a |
14 | 797d4ad3cad |
15 | 3cc28d0710b |
hex | 20575785101 |
2222468911361 has 2 divisors, whose sum is σ = 2222468911362. Its totient is φ = 2222468911360.
The previous prime is 2222468911357. The next prime is 2222468911363. The reversal of 2222468911361 is 1631198642222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2208508071025 + 13960840336 = 1486105^2 + 118156^2 .
It is a cyclic number.
It is not a de Polignac number, because 2222468911361 - 22 = 2222468911357 is a prime.
It is a super-2 number, since 2×22224689113612 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 2222468911363, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2222468911363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1111234455680 + 1111234455681.
It is an arithmetic number, because the mean of its divisors is an integer number (1111234455681).
Almost surely, 22222468911361 is an apocalyptic number.
It is an amenable number.
2222468911361 is a deficient number, since it is larger than the sum of its proper divisors (1).
2222468911361 is an equidigital number, since it uses as much as digits as its factorization.
2222468911361 is an evil number, because the sum of its binary digits is even.
The product of its digits is 497664, while the sum is 47.
The spelling of 2222468911361 in words is "two trillion, two hundred twenty-two billion, four hundred sixty-eight million, nine hundred eleven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •