Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …101110111010000100110111 |
3 | 111020121121020100121022021002 |
4 | 112331300200232322010313 |
5 | 101214300022011201101 |
6 | 554451115140513515 |
7 | 30163036636460204 |
oct | 2675604056720467 |
9 | 436547210538232 |
10 | 101001000100151 |
11 | 2a200313514118 |
12 | b3b28066ab89b |
13 | 4448479685408 |
14 | 1ad268ddd0cab |
15 | ba2403c36d6b |
hex | 5bdc20bba137 |
101001000100151 has 2 divisors, whose sum is σ = 101001000100152. Its totient is φ = 101001000100150.
The previous prime is 101001000100093. The next prime is 101001000100163. The reversal of 101001000100151 is 151001000100101.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (151001000100101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101001000100151 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101001000100751) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500500050075 + 50500500050076.
It is an arithmetic number, because the mean of its divisors is an integer number (50500500050076).
Almost surely, 2101001000100151 is an apocalyptic number.
101001000100151 is a deficient number, since it is larger than the sum of its proper divisors (1).
101001000100151 is an equidigital number, since it uses as much as digits as its factorization.
101001000100151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 11.
Adding to 101001000100151 its reverse (151001000100101), we get a palindrome (252002000200252).
The spelling of 101001000100151 in words is "one hundred one trillion, one billion, one hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •