Base | Representation |
---|---|
bin | 10011011001010100… |
… | …11101010011101101 |
3 | 222212200220102010022 |
4 | 21230222131103231 |
5 | 132311212112023 |
6 | 4441134451525 |
7 | 516021034166 |
oct | 115452352355 |
9 | 28780812108 |
10 | 10413004013 |
11 | 4463962045 |
12 | 2027363ba5 |
13 | c9c432a49 |
14 | 70ad5076d |
15 | 40e28e7c8 |
hex | 26ca9d4ed |
10413004013 has 2 divisors, whose sum is σ = 10413004014. Its totient is φ = 10413004012.
The previous prime is 10413004009. The next prime is 10413004031. The reversal of 10413004013 is 31040031401.
Together with next prime (10413004031) 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., 10341466249 + 71537764 = 101693^2 + 8458^2 .
It is a cyclic number.
It is not a de Polignac number, because 10413004013 - 22 = 10413004009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10413003982 and 10413004000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10413004513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5206502006 + 5206502007.
It is an arithmetic number, because the mean of its divisors is an integer number (5206502007).
Almost surely, 210413004013 is an apocalyptic number.
It is an amenable number.
10413004013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10413004013 is an equidigital number, since it uses as much as digits as its factorization.
10413004013 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 17.
Adding to 10413004013 its reverse (31040031401), we get a palindrome (41453035414).
The spelling of 10413004013 in words is "ten billion, four hundred thirteen million, four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •