Base | Representation |
---|---|
bin | 10011011001010110… |
… | …10001000100000001 |
3 | 222212201022011220201 |
4 | 21230223101010001 |
5 | 132311240403001 |
6 | 4441143205201 |
7 | 516022606216 |
oct | 115453210401 |
9 | 28781264821 |
10 | 10413216001 |
11 | 4463a97341 |
12 | 2027446801 |
13 | c9c4a8396 |
14 | 70ada7b0d |
15 | 40e2d2501 |
hex | 26cad1101 |
10413216001 has 2 divisors, whose sum is σ = 10413216002. Its totient is φ = 10413216000.
The previous prime is 10413215987. The next prime is 10413216007. The reversal of 10413216001 is 10061231401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8869118976 + 1544097025 = 94176^2 + 39295^2 .
It is a cyclic number.
It is not a de Polignac number, because 10413216001 - 215 = 10413183233 is a prime.
It is a super-3 number, since 3×104132160013 (a number of 31 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10413216001.
It is not a weakly prime, because it can be changed into another prime (10413216007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5206608000 + 5206608001.
It is an arithmetic number, because the mean of its divisors is an integer number (5206608001).
Almost surely, 210413216001 is an apocalyptic number.
It is an amenable number.
10413216001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10413216001 is an equidigital number, since it uses as much as digits as its factorization.
10413216001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10413216001 its reverse (10061231401), we get a palindrome (20474447402).
The spelling of 10413216001 in words is "ten billion, four hundred thirteen million, two hundred sixteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •