Base | Representation |
---|---|
bin | 1010000000111111010101… |
… | …00101100001101001000001 |
3 | 2212222111101200000221111001 |
4 | 11000133222211201221001 |
5 | 10341321112124013012 |
6 | 114501443141052001 |
7 | 4432125011632531 |
oct | 500375245415101 |
9 | 85874350027431 |
10 | 22024233032257 |
11 | 7021474415705 |
12 | 257853b0b7001 |
13 | c39b511c5941 |
14 | 561d9b2874c1 |
15 | 282d7a536357 |
hex | 1407ea961a41 |
22024233032257 has 2 divisors, whose sum is σ = 22024233032258. Its totient is φ = 22024233032256.
The previous prime is 22024233032189. The next prime is 22024233032309. The reversal of 22024233032257 is 75223033242022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21912519328561 + 111713703696 = 4681081^2 + 334236^2 .
It is a cyclic number.
It is not a de Polignac number, because 22024233032257 - 219 = 22024232507969 is a prime.
It is not a weakly prime, because it can be changed into another prime (22024233032057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11012116516128 + 11012116516129.
It is an arithmetic number, because the mean of its divisors is an integer number (11012116516129).
Almost surely, 222024233032257 is an apocalyptic number.
It is an amenable number.
22024233032257 is a deficient number, since it is larger than the sum of its proper divisors (1).
22024233032257 is an equidigital number, since it uses as much as digits as its factorization.
22024233032257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 241920, while the sum is 37.
Adding to 22024233032257 its reverse (75223033242022), we get a palindrome (97247266274279).
The spelling of 22024233032257 in words is "twenty-two trillion, twenty-four billion, two hundred thirty-three million, thirty-two thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •