Base | Representation |
---|---|
bin | 1001000110010110011100… |
… | …1110001100010111110001 |
3 | 1022102102220111001211220011 |
4 | 2101211213032030113301 |
5 | 2302404121403400241 |
6 | 33140033421414521 |
7 | 2051550025005364 |
oct | 221454716142761 |
9 | 38372814054804 |
10 | 10004710606321 |
11 | 3207a793512a2 |
12 | 1156b9140a441 |
13 | 577595060b42 |
14 | 2683329bc0db |
15 | 1253a3783281 |
hex | 9196738c5f1 |
10004710606321 has 2 divisors, whose sum is σ = 10004710606322. Its totient is φ = 10004710606320.
The previous prime is 10004710606237. The next prime is 10004710606343. The reversal of 10004710606321 is 12360601740001.
10004710606321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8433796810000 + 1570913796321 = 2904100^2 + 1253361^2 .
It is a cyclic number.
It is not a de Polignac number, because 10004710606321 - 243 = 1208617584113 is a prime.
It is a super-2 number, since 2×100047106063212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10004710606021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5002355303160 + 5002355303161.
It is an arithmetic number, because the mean of its divisors is an integer number (5002355303161).
Almost surely, 210004710606321 is an apocalyptic number.
It is an amenable number.
10004710606321 is a deficient number, since it is larger than the sum of its proper divisors (1).
10004710606321 is an equidigital number, since it uses as much as digits as its factorization.
10004710606321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6048, while the sum is 31.
The spelling of 10004710606321 in words is "ten trillion, four billion, seven hundred ten million, six hundred six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •