Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1001100010101001010111 |
3 | 1022102002100120202010001111 |
4 | 2101202022221202221113 |
5 | 2302324032030320321 |
6 | 33134222305035451 |
7 | 2051356231321036 |
oct | 221421251425127 |
9 | 38362316663044 |
10 | 10001010010711 |
11 | 320644a475015 |
12 | 115631a025b87 |
13 | 57712548c0b5 |
14 | 2680a132471d |
15 | 1252389505e1 |
hex | 9188aa62a57 |
10001010010711 has 2 divisors, whose sum is σ = 10001010010712. Its totient is φ = 10001010010710.
The previous prime is 10001010010699. The next prime is 10001010010723. The reversal of 10001010010711 is 11701001010001.
It is a balanced prime because it is at equal distance from previous prime (10001010010699) and next prime (10001010010723).
It is a cyclic number.
It is not a de Polignac number, because 10001010010711 - 241 = 7801986755159 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10001010010691 and 10001010010700.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10001010010111) 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, 5000505005355 + 5000505005356.
It is an arithmetic number, because the mean of its divisors is an integer number (5000505005356).
Almost surely, 210001010010711 is an apocalyptic number.
10001010010711 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001010010711 is an equidigital number, since it uses as much as digits as its factorization.
10001010010711 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 13.
Adding to 10001010010711 its reverse (11701001010001), we get a palindrome (21702011020712).
The spelling of 10001010010711 in words is "ten trillion, one billion, ten million, ten thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •