Base | Representation |
---|---|
bin | 100010111101010010001… |
… | …101101100111010011101 |
3 | 22111122200001101002012212 |
4 | 202331102031230322131 |
5 | 303324320101321023 |
6 | 5035330310210205 |
7 | 335362251305405 |
oct | 42752215547235 |
9 | 8448601332185 |
10 | 2402266042013 |
11 | 846882610082 |
12 | 3296aa053965 |
13 | 1456c04b8176 |
14 | 843ad9a1805 |
15 | 4274d7dae78 |
hex | 22f5236ce9d |
2402266042013 has 2 divisors, whose sum is σ = 2402266042014. Its totient is φ = 2402266042012.
The previous prime is 2402266041983. The next prime is 2402266042031. The reversal of 2402266042013 is 3102406622042.
It is a happy number.
Together with next prime (2402266042031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1260740471929 + 1141525570084 = 1122827^2 + 1068422^2 .
It is a cyclic number.
It is not a de Polignac number, because 2402266042013 - 230 = 2401192300189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2402266042613) 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, 1201133021006 + 1201133021007.
It is an arithmetic number, because the mean of its divisors is an integer number (1201133021007).
Almost surely, 22402266042013 is an apocalyptic number.
It is an amenable number.
2402266042013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2402266042013 is an equidigital number, since it uses as much as digits as its factorization.
2402266042013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 32.
The spelling of 2402266042013 in words is "two trillion, four hundred two billion, two hundred sixty-six million, forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •