Base | Representation |
---|---|
bin | 1010000000010111110101… |
… | …10111000100110110101101 |
3 | 2212220110200002002220002121 |
4 | 11000023322313010312231 |
5 | 10340444201443410132 |
6 | 114444015240552541 |
7 | 4430444424411541 |
oct | 500137267046655 |
9 | 85813602086077 |
10 | 22003031231917 |
11 | 701348457026a |
12 | 2574402782751 |
13 | c37b52846258 |
14 | 560d49523a21 |
15 | 282539026497 |
hex | 1402fadc4dad |
22003031231917 has 2 divisors, whose sum is σ = 22003031231918. Its totient is φ = 22003031231916.
The previous prime is 22003031231873. The next prime is 22003031231921. The reversal of 22003031231917 is 71913213030022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21579638961321 + 423392270596 = 4645389^2 + 650686^2 .
It is a cyclic number.
It is not a de Polignac number, because 22003031231917 - 219 = 22003030707629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22003031231417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11001515615958 + 11001515615959.
It is an arithmetic number, because the mean of its divisors is an integer number (11001515615959).
Almost surely, 222003031231917 is an apocalyptic number.
It is an amenable number.
22003031231917 is a deficient number, since it is larger than the sum of its proper divisors (1).
22003031231917 is an equidigital number, since it uses as much as digits as its factorization.
22003031231917 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 34.
Adding to 22003031231917 its reverse (71913213030022), we get a palindrome (93916244261939).
The spelling of 22003031231917 in words is "twenty-two trillion, three billion, thirty-one million, two hundred thirty-one thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •