Base | Representation |
---|---|
bin | 10011111010010111… |
… | …00110100110110111 |
3 | 1000121000100210012012 |
4 | 21331023212212313 |
5 | 133343133101221 |
6 | 4524434314435 |
7 | 525624406562 |
oct | 117513464667 |
9 | 30530323165 |
10 | 10690128311 |
11 | 4596331695 |
12 | 20a4128a1b |
13 | 1014981515 |
14 | 735a8b4d9 |
15 | 42878065b |
hex | 27d2e69b7 |
10690128311 has 2 divisors, whose sum is σ = 10690128312. Its totient is φ = 10690128310.
The previous prime is 10690128283. The next prime is 10690128329. The reversal of 10690128311 is 11382109601.
It is a strong prime.
It is an emirp because it is prime and its reverse (11382109601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10690128311 - 26 = 10690128247 is a prime.
It is a super-2 number, since 2×106901283112 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10690124311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5345064155 + 5345064156.
It is an arithmetic number, because the mean of its divisors is an integer number (5345064156).
Almost surely, 210690128311 is an apocalyptic number.
10690128311 is a deficient number, since it is larger than the sum of its proper divisors (1).
10690128311 is an equidigital number, since it uses as much as digits as its factorization.
10690128311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 32.
The spelling of 10690128311 in words is "ten billion, six hundred ninety million, one hundred twenty-eight thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •