Base | Representation |
---|---|
bin | 1001000110010101110010… |
… | …0011000010110011111101 |
3 | 1022102102110000002110111122 |
4 | 2101211130203002303331 |
5 | 2302403240032212223 |
6 | 33140003543200325 |
7 | 2051542421555132 |
oct | 221453443026375 |
9 | 38372400073448 |
10 | 10004531522813 |
11 | 32079972551a3 |
12 | 1156b414460a5 |
13 | 577566c1b179 |
14 | 268316cc2589 |
15 | 125392bab5c8 |
hex | 9195c8c2cfd |
10004531522813 has 2 divisors, whose sum is σ = 10004531522814. Its totient is φ = 10004531522812.
The previous prime is 10004531522779. The next prime is 10004531522891. The reversal of 10004531522813 is 31822513540001.
10004531522813 is digitally balanced in base 2, 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., 10000602991129 + 3928531684 = 3162373^2 + 62678^2 .
It is a cyclic number.
It is not a de Polignac number, because 10004531522813 - 226 = 10004464413949 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 (10004531521813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5002265761406 + 5002265761407.
It is an arithmetic number, because the mean of its divisors is an integer number (5002265761407).
Almost surely, 210004531522813 is an apocalyptic number.
It is an amenable number.
10004531522813 is a deficient number, since it is larger than the sum of its proper divisors (1).
10004531522813 is an equidigital number, since it uses as much as digits as its factorization.
10004531522813 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28800, while the sum is 35.
The spelling of 10004531522813 in words is "ten trillion, four billion, five hundred thirty-one million, five hundred twenty-two thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •