Base | Representation |
---|---|
bin | 10110101111010101100100… |
… | …100001111101001001000111 |
3 | 111010002212021212021202111202 |
4 | 112233111210201331021013 |
5 | 101102030440012011101 |
6 | 552411543151453115 |
7 | 30031325014523315 |
oct | 2657254441751107 |
9 | 433085255252452 |
10 | 100010000110151 |
11 | 29959003896a1a |
12 | b27273682719b |
13 | 43a5b96b715a1 |
14 | 1a9a71cda30b5 |
15 | b867526a036b |
hex | 5af56487d247 |
100010000110151 has 2 divisors, whose sum is σ = 100010000110152. Its totient is φ = 100010000110150.
The previous prime is 100010000110127. The next prime is 100010000110199. The reversal of 100010000110151 is 151011000010001.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (151011000010001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100010000110151 - 26 = 100010000110087 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100010000110651) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50005000055075 + 50005000055076.
It is an arithmetic number, because the mean of its divisors is an integer number (50005000055076).
Almost surely, 2100010000110151 is an apocalyptic number.
100010000110151 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010000110151 is an equidigital number, since it uses as much as digits as its factorization.
100010000110151 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 100010000110151 its reverse (151011000010001), we get a palindrome (251021000120152).
The spelling of 100010000110151 in words is "one hundred trillion, ten billion, one hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •