Base | Representation |
---|---|
bin | 1010000110001001000001… |
… | …00000110000000011100001 |
3 | 2220121102020222201010012221 |
4 | 11003010200200300003201 |
5 | 10402221110220100002 |
6 | 115115034354351041 |
7 | 4450662132210526 |
oct | 503044040600341 |
9 | 86542228633187 |
10 | 22201231409377 |
11 | 708a542389119 |
12 | 25a68b758b481 |
13 | c5074b008077 |
14 | 56a78c57714d |
15 | 287789479c37 |
hex | 1431208300e1 |
22201231409377 has 2 divisors, whose sum is σ = 22201231409378. Its totient is φ = 22201231409376.
The previous prime is 22201231409261. The next prime is 22201231409381. The reversal of 22201231409377 is 77390413210222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19736836923456 + 2464394485921 = 4442616^2 + 1569839^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22201231409377 is a prime.
It is not a weakly prime, because it can be changed into another prime (22201231409387) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11100615704688 + 11100615704689.
It is an arithmetic number, because the mean of its divisors is an integer number (11100615704689).
Almost surely, 222201231409377 is an apocalyptic number.
It is an amenable number.
22201231409377 is a deficient number, since it is larger than the sum of its proper divisors (1).
22201231409377 is an equidigital number, since it uses as much as digits as its factorization.
22201231409377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 254016, while the sum is 43.
Adding to 22201231409377 its reverse (77390413210222), we get a palindrome (99591644619599).
The spelling of 22201231409377 in words is "twenty-two trillion, two hundred one billion, two hundred thirty-one million, four hundred nine thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •