Base | Representation |
---|---|
bin | 1001101100110000110110… |
… | …0101001000100110001001 |
3 | 1101202112021111220111220102 |
4 | 2123030031211020212021 |
5 | 2344212131144244223 |
6 | 34403133015335145 |
7 | 2150331341126126 |
oct | 233141545104611 |
9 | 41675244814812 |
10 | 10664631634313 |
11 | 3441932593028 |
12 | 1242a636814b5 |
13 | 5c4893c88017 |
14 | 28c25703974d |
15 | 137628e54928 |
hex | 9b30d948989 |
10664631634313 has 2 divisors, whose sum is σ = 10664631634314. Its totient is φ = 10664631634312.
The previous prime is 10664631634309. The next prime is 10664631634339. The reversal of 10664631634313 is 31343613646601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9907587207424 + 757044426889 = 3147632^2 + 870083^2 .
It is a cyclic number.
It is not a de Polignac number, because 10664631634313 - 22 = 10664631634309 is a prime.
It is a super-2 number, since 2×106646316343132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10664631634513) 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, 5332315817156 + 5332315817157.
It is an arithmetic number, because the mean of its divisors is an integer number (5332315817157).
Almost surely, 210664631634313 is an apocalyptic number.
It is an amenable number.
10664631634313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10664631634313 is an equidigital number, since it uses as much as digits as its factorization.
10664631634313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1679616, while the sum is 47.
The spelling of 10664631634313 in words is "ten trillion, six hundred sixty-four billion, six hundred thirty-one million, six hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •