Base | Representation |
---|---|
bin | 1010001011111011010000… |
… | …01010011010110101010101 |
3 | 2221022102022122122212102212 |
4 | 11011331220022122311111 |
5 | 10414000201003313303 |
6 | 115350230250243205 |
7 | 4501226634353234 |
oct | 505755012326525 |
9 | 87272278585385 |
10 | 22400002010453 |
11 | 7156873193751 |
12 | 261932b426505 |
13 | c6640770b552 |
14 | 576247274b1b |
15 | 28ca1ea07ad8 |
hex | 145f6829ad55 |
22400002010453 has 2 divisors, whose sum is σ = 22400002010454. Its totient is φ = 22400002010452.
The previous prime is 22400002010303. The next prime is 22400002010483. The reversal of 22400002010453 is 35401020000422.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22135500606244 + 264501404209 = 4704838^2 + 514297^2 .
It is a cyclic number.
It is not a de Polignac number, because 22400002010453 - 212 = 22400002006357 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22400002010483) 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, 11200001005226 + 11200001005227.
It is an arithmetic number, because the mean of its divisors is an integer number (11200001005227).
Almost surely, 222400002010453 is an apocalyptic number.
It is an amenable number.
22400002010453 is a deficient number, since it is larger than the sum of its proper divisors (1).
22400002010453 is an equidigital number, since it uses as much as digits as its factorization.
22400002010453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 23.
Adding to 22400002010453 its reverse (35401020000422), we get a palindrome (57801022010875).
The spelling of 22400002010453 in words is "twenty-two trillion, four hundred billion, two million, ten thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •