Base | Representation |
---|---|
bin | 1001001110001111111101… |
… | …0001101111101010101011 |
3 | 1022220102011022020210221021 |
4 | 2103203333101233222223 |
5 | 2312120022322112311 |
6 | 33322234341353311 |
7 | 2064422463641632 |
oct | 223437721575253 |
9 | 38812138223837 |
10 | 10140405660331 |
11 | 325a5816a9831 |
12 | 1179341408837 |
13 | 58730ba912cb |
14 | 270b26596519 |
15 | 128b96595171 |
hex | 938ff46faab |
10140405660331 has 2 divisors, whose sum is σ = 10140405660332. Its totient is φ = 10140405660330.
The previous prime is 10140405660289. The next prime is 10140405660337. The reversal of 10140405660331 is 13306650404101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10140405660331 - 211 = 10140405658283 is a prime.
It is a super-2 number, since 2×101404056603312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10140405660337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070202830165 + 5070202830166.
It is an arithmetic number, because the mean of its divisors is an integer number (5070202830166).
Almost surely, 210140405660331 is an apocalyptic number.
10140405660331 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140405660331 is an equidigital number, since it uses as much as digits as its factorization.
10140405660331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 34.
The spelling of 10140405660331 in words is "ten trillion, one hundred forty billion, four hundred five million, six hundred sixty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •