Base | Representation |
---|---|
bin | 1100111011000011110… |
… | …1000010010010010001 |
3 | 210020001101222100120201 |
4 | 3032300331002102101 |
5 | 12114140100403012 |
6 | 245554014135201 |
7 | 22016444621362 |
oct | 3166075022221 |
9 | 706041870521 |
10 | 222012122257 |
11 | 86178067482 |
12 | 3703b4b1501 |
13 | 17c218269a3 |
14 | aa616d9b69 |
15 | 5b95b99857 |
hex | 33b0f42491 |
222012122257 has 2 divisors, whose sum is σ = 222012122258. Its totient is φ = 222012122256.
The previous prime is 222012122201. The next prime is 222012122263. The reversal of 222012122257 is 752221210222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 156312692496 + 65699429761 = 395364^2 + 256319^2 .
It is a cyclic number.
It is not a de Polignac number, because 222012122257 - 235 = 187652383889 is a prime.
It is a super-2 number, since 2×2220121222572 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (222012120257) 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 as a sum of consecutive naturals, namely, 111006061128 + 111006061129.
It is an arithmetic number, because the mean of its divisors is an integer number (111006061129).
Almost surely, 2222012122257 is an apocalyptic number.
It is an amenable number.
222012122257 is a deficient number, since it is larger than the sum of its proper divisors (1).
222012122257 is an equidigital number, since it uses as much as digits as its factorization.
222012122257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4480, while the sum is 28.
Adding to 222012122257 its reverse (752221210222), we get a palindrome (974233332479).
The spelling of 222012122257 in words is "two hundred twenty-two billion, twelve million, one hundred twenty-two thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •