Base | Representation |
---|---|
bin | 10010101000101101… |
… | …10100110110111101 |
3 | 221211021120001020102 |
4 | 21110112310312331 |
5 | 130442313020123 |
6 | 4332450130445 |
7 | 502636556111 |
oct | 112426646675 |
9 | 27737501212 |
10 | 10005204413 |
11 | 427474a186 |
12 | 1b32880a25 |
13 | c35ac02c9 |
14 | 6acb19741 |
15 | 3d858a028 |
hex | 2545b4dbd |
10005204413 has 2 divisors, whose sum is σ = 10005204414. Its totient is φ = 10005204412.
The previous prime is 10005204409. The next prime is 10005204449. The reversal of 10005204413 is 31440250001.
10005204413 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9044390404 + 960814009 = 95102^2 + 30997^2 .
It is a cyclic number.
It is not a de Polignac number, because 10005204413 - 22 = 10005204409 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10005209413) 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, 5002602206 + 5002602207.
It is an arithmetic number, because the mean of its divisors is an integer number (5002602207).
Almost surely, 210005204413 is an apocalyptic number.
It is an amenable number.
10005204413 is a deficient number, since it is larger than the sum of its proper divisors (1).
10005204413 is an equidigital number, since it uses as much as digits as its factorization.
10005204413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 10005204413 its reverse (31440250001), we get a palindrome (41445454414).
The spelling of 10005204413 in words is "ten billion, five million, two hundred four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •