Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …001110111101011000111111 |
3 | 111020122110110122112222020121 |
4 | 112331320321032331120333 |
5 | 101214421440234340421 |
6 | 554455204235155411 |
7 | 30163505663563351 |
oct | 2675707116753077 |
9 | 436573418488217 |
10 | 101010001090111 |
11 | 2a2041123210a3 |
12 | b3b44b8ba5b67 |
13 | 44492823c1189 |
14 | 1ad2ca55c30d1 |
15 | ba277e05bd41 |
hex | 5bde393bd63f |
101010001090111 has 2 divisors, whose sum is σ = 101010001090112. Its totient is φ = 101010001090110.
The previous prime is 101010001090091. The next prime is 101010001090121. The reversal of 101010001090111 is 111090100010101.
It is a strong prime.
It is an emirp because it is prime and its reverse (111090100010101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101010001090111 - 235 = 100975641351743 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101010001090121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505000545055 + 50505000545056.
It is an arithmetic number, because the mean of its divisors is an integer number (50505000545056).
Almost surely, 2101010001090111 is an apocalyptic number.
101010001090111 is a deficient number, since it is larger than the sum of its proper divisors (1).
101010001090111 is an equidigital number, since it uses as much as digits as its factorization.
101010001090111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 101010001090111 in words is "one hundred one trillion, ten billion, one million, ninety thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •