Base | Representation |
---|---|
bin | 1000001100110110… |
… | …1110001100111101 |
3 | 12200102100100010002 |
4 | 2003031232030331 |
5 | 14002030144123 |
6 | 1002235524045 |
7 | 105360460664 |
oct | 20315561475 |
9 | 5612310102 |
10 | 2201412413 |
11 | a2a704802 |
12 | 5152b9625 |
13 | 2911074c5 |
14 | 16c527ddb |
15 | cd3ea528 |
hex | 8336e33d |
2201412413 has 2 divisors, whose sum is σ = 2201412414. Its totient is φ = 2201412412.
The previous prime is 2201412401. The next prime is 2201412443. The reversal of 2201412413 is 3142141022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1697275204 + 504137209 = 41198^2 + 22453^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201412413 - 230 = 1127670589 is a prime.
It is a super-2 number, since 2×22014124132 = 9692433224220965138, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201412443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100706206 + 1100706207.
It is an arithmetic number, because the mean of its divisors is an integer number (1100706207).
Almost surely, 22201412413 is an apocalyptic number.
It is an amenable number.
2201412413 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201412413 is an equidigital number, since it uses as much as digits as its factorization.
2201412413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 2201412413 is about 46919.2115556091. The cubic root of 2201412413 is about 1300.8697164410.
Adding to 2201412413 its reverse (3142141022), we get a palindrome (5343553435).
The spelling of 2201412413 in words is "two billion, two hundred one million, four hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •