Base | Representation |
---|---|
bin | 1001000110110010110101… |
… | …1100001101100100101001 |
3 | 1022110011120120102221012001 |
4 | 2101230231130031210221 |
5 | 2303020223232343241 |
6 | 33143333524051001 |
7 | 2052236620314052 |
oct | 221545534154451 |
9 | 38404516387161 |
10 | 10012331137321 |
11 | 32102299a6aa7 |
12 | 1158559533a61 |
13 | 57820aaa0696 |
14 | 268856b07729 |
15 | 12569c7c3431 |
hex | 91b2d70d929 |
10012331137321 has 2 divisors, whose sum is σ = 10012331137322. Its totient is φ = 10012331137320.
The previous prime is 10012331137141. The next prime is 10012331137351. The reversal of 10012331137321 is 12373113321001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9843504654096 + 168826483225 = 3137436^2 + 410885^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10012331137321 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10012331137321.
It is not a weakly prime, because it can be changed into another prime (10012331137351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5006165568660 + 5006165568661.
It is an arithmetic number, because the mean of its divisors is an integer number (5006165568661).
Almost surely, 210012331137321 is an apocalyptic number.
It is an amenable number.
10012331137321 is a deficient number, since it is larger than the sum of its proper divisors (1).
10012331137321 is an equidigital number, since it uses as much as digits as its factorization.
10012331137321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 28.
Adding to 10012331137321 its reverse (12373113321001), we get a palindrome (22385444458322).
The spelling of 10012331137321 in words is "ten trillion, twelve billion, three hundred thirty-one million, one hundred thirty-seven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •