Base | Representation |
---|---|
bin | 10110111101110000100111… |
… | …010010001001010111111101 |
3 | 111020121121112000101212002102 |
4 | 112331300213102021113331 |
5 | 101214300233130014044 |
6 | 554451134104234445 |
7 | 30163042442560241 |
oct | 2675604722112775 |
9 | 436547460355072 |
10 | 101001110001149 |
11 | 2a20036a558396 |
12 | b3b283746ba25 |
13 | 44484963846a7 |
14 | 1ad26a083c421 |
15 | ba240d6e524e |
hex | 5bdc274895fd |
101001110001149 has 2 divisors, whose sum is σ = 101001110001150. Its totient is φ = 101001110001148.
The previous prime is 101001110000993. The next prime is 101001110001151. The reversal of 101001110001149 is 941100011100101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69536302578649 + 31464807422500 = 8338843^2 + 5609350^2 .
It is a cyclic number.
It is not a de Polignac number, because 101001110001149 - 216 = 101001109935613 is a prime.
Together with 101001110001151, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101001110001149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101001110000149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500555000574 + 50500555000575.
It is an arithmetic number, because the mean of its divisors is an integer number (50500555000575).
Almost surely, 2101001110001149 is an apocalyptic number.
It is an amenable number.
101001110001149 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001110001149 is an equidigital number, since it uses as much as digits as its factorization.
101001110001149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 101001110001149 in words is "one hundred one trillion, one billion, one hundred ten million, one thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •