Base | Representation |
---|---|
bin | 110010100001110000010111… |
… | …010111110000101111010101 |
3 | 1002010211012211021002220002212 |
4 | 302201300113113300233111 |
5 | 213111341123444444312 |
6 | 2104343213311043205 |
7 | 64544003214610166 |
oct | 6241602727605725 |
9 | 1063735737086085 |
10 | 222221999999957 |
11 | 64896903758a11 |
12 | 20b10142210505 |
13 | 96cc5a1c780a9 |
14 | 3cc386059376d |
15 | 1aa57869a5822 |
hex | ca1c175f0bd5 |
222221999999957 has 2 divisors, whose sum is σ = 222221999999958. Its totient is φ = 222221999999956.
The previous prime is 222221999999947. The next prime is 222221999999959. The reversal of 222221999999957 is 759999999122222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 177426902188561 + 44795097811396 = 13320169^2 + 6692914^2 .
It is a cyclic number.
It is not a de Polignac number, because 222221999999957 - 214 = 222221999983573 is a prime.
Together with 222221999999959, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222221999999959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111110999999978 + 111110999999979.
It is an arithmetic number, because the mean of its divisors is an integer number (111110999999979).
Almost surely, 2222221999999957 is an apocalyptic number.
It is an amenable number.
222221999999957 is a deficient number, since it is larger than the sum of its proper divisors (1).
222221999999957 is an equidigital number, since it uses as much as digits as its factorization.
222221999999957 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5356925280, while the sum is 86.
The spelling of 222221999999957 in words is "two hundred twenty-two trillion, two hundred twenty-one billion, nine hundred ninety-nine million, nine hundred ninety-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •