Base | Representation |
---|---|
bin | 1001000110000100111100… |
… | …0110101010000001100111 |
3 | 1022101222202221221121220202 |
4 | 2101201033012222001213 |
5 | 2302320010304311101 |
6 | 33133535221021115 |
7 | 2051322411052001 |
oct | 221411706520147 |
9 | 38358687847822 |
10 | 10000011010151 |
11 | 3205a87574118 |
12 | 115609b55479b |
13 | 576cc6511ac6 |
14 | 268008797371 |
15 | 1251cadba36b |
hex | 9184f1aa067 |
10000011010151 has 2 divisors, whose sum is σ = 10000011010152. Its totient is φ = 10000011010150.
The previous prime is 10000011010147. The next prime is 10000011010181. The reversal of 10000011010151 is 15101011000001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10000011010151 - 22 = 10000011010147 is a prime.
It is a super-3 number, since 3×100000110101513 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000011010181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000005505075 + 5000005505076.
It is an arithmetic number, because the mean of its divisors is an integer number (5000005505076).
Almost surely, 210000011010151 is an apocalyptic number.
10000011010151 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000011010151 is an equidigital number, since it uses as much as digits as its factorization.
10000011010151 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 10000011010151 its reverse (15101011000001), we get a palindrome (25101022010152).
The spelling of 10000011010151 in words is "ten trillion, eleven million, ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •