Base | Representation |
---|---|
bin | 1000010001110111… |
… | …0010011100010101 |
3 | 12201212211200110022 |
4 | 2010131302130111 |
5 | 14022413320201 |
6 | 1004305434525 |
7 | 106034046041 |
oct | 20435623425 |
9 | 5655750408 |
10 | 2222401301 |
11 | a4053aa9a |
12 | 52033ba45 |
13 | 295575a73 |
14 | 17122d021 |
15 | d019441b |
hex | 84772715 |
2222401301 has 2 divisors, whose sum is σ = 2222401302. Its totient is φ = 2222401300.
The previous prime is 2222401267. The next prime is 2222401331. The reversal of 2222401301 is 1031042222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1883473201 + 338928100 = 43399^2 + 18410^2 .
It is a cyclic number.
It is not a de Polignac number, because 2222401301 - 222 = 2218206997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2222401301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2222401331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1111200650 + 1111200651.
It is an arithmetic number, because the mean of its divisors is an integer number (1111200651).
Almost surely, 22222401301 is an apocalyptic number.
It is an amenable number.
2222401301 is a deficient number, since it is larger than the sum of its proper divisors (1).
2222401301 is an equidigital number, since it uses as much as digits as its factorization.
2222401301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 2222401301 is about 47142.3514581104. The cubic root of 2222401301 is about 1304.9909329337.
Adding to 2222401301 its reverse (1031042222), we get a palindrome (3253443523).
The spelling of 2222401301 in words is "two billion, two hundred twenty-two million, four hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •