Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …001110111101011001001001 |
3 | 111020122110110122112222020222 |
4 | 112331320321032331121021 |
5 | 101214421440234340441 |
6 | 554455204235155425 |
7 | 30163505663563364 |
oct | 2675707116753111 |
9 | 436573418488228 |
10 | 101010001090121 |
11 | 2a204112321102 |
12 | b3b44b8ba5b75 |
13 | 44492823c1196 |
14 | 1ad2ca55c30db |
15 | ba277e05bd4b |
hex | 5bde393bd649 |
101010001090121 has 2 divisors, whose sum is σ = 101010001090122. Its totient is φ = 101010001090120.
The previous prime is 101010001090111. The next prime is 101010001090127. The reversal of 101010001090121 is 121090100010101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61319862490000 + 39690138600121 = 7830700^2 + 6300011^2 .
It is an emirp because it is prime and its reverse (121090100010101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101010001090121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101010001090121.
It is not a weakly prime, because it can be changed into another prime (101010001090127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505000545060 + 50505000545061.
It is an arithmetic number, because the mean of its divisors is an integer number (50505000545061).
Almost surely, 2101010001090121 is an apocalyptic number.
It is an amenable number.
101010001090121 is a deficient number, since it is larger than the sum of its proper divisors (1).
101010001090121 is an equidigital number, since it uses as much as digits as its factorization.
101010001090121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 17.
The spelling of 101010001090121 in words is "one hundred one trillion, ten billion, one million, ninety thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •