Base | Representation |
---|---|
bin | 1010001011111111100010… |
… | …10000010110000011001001 |
3 | 2221022122020221120121000001 |
4 | 11011333301100112003021 |
5 | 10414014403310323223 |
6 | 115351250412043001 |
7 | 4501340633326414 |
oct | 505776120260311 |
9 | 87278227517001 |
10 | 22402302042313 |
11 | 7157843526726 |
12 | 2619871763461 |
13 | c666b309504b |
14 | 5763c4910b7b |
15 | 28cb068d39ad |
hex | 145ff14160c9 |
22402302042313 has 2 divisors, whose sum is σ = 22402302042314. Its totient is φ = 22402302042312.
The previous prime is 22402302042301. The next prime is 22402302042331. The reversal of 22402302042313 is 31324020320422.
Together with next prime (22402302042331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12010466534544 + 10391835507769 = 3465612^2 + 3223637^2 .
It is a cyclic number.
It is not a de Polignac number, because 22402302042313 - 221 = 22402299945161 is a prime.
It is not a weakly prime, because it can be changed into another prime (22402302042713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11201151021156 + 11201151021157.
It is an arithmetic number, because the mean of its divisors is an integer number (11201151021157).
Almost surely, 222402302042313 is an apocalyptic number.
It is an amenable number.
22402302042313 is a deficient number, since it is larger than the sum of its proper divisors (1).
22402302042313 is an equidigital number, since it uses as much as digits as its factorization.
22402302042313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 22402302042313 its reverse (31324020320422), we get a palindrome (53726322362735).
The spelling of 22402302042313 in words is "twenty-two trillion, four hundred two billion, three hundred two million, forty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •