Base | Representation |
---|---|
bin | 10010110100001000… |
… | …10011011010110111 |
3 | 222001221211120202011 |
4 | 21122010103122313 |
5 | 131141324342101 |
6 | 4350151425051 |
7 | 505212121006 |
oct | 113204233267 |
9 | 28057746664 |
10 | 10101012151 |
11 | 4313837a2a |
12 | 1b5a985187 |
13 | c4c8c6889 |
14 | 6bb738c3d |
15 | 3e1bb2751 |
hex | 25a1136b7 |
10101012151 has 2 divisors, whose sum is σ = 10101012152. Its totient is φ = 10101012150.
The previous prime is 10101012107. The next prime is 10101012209. The reversal of 10101012151 is 15121010101.
10101012151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10101012151 - 219 = 10100487863 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101052151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050506075 + 5050506076.
It is an arithmetic number, because the mean of its divisors is an integer number (5050506076).
Almost surely, 210101012151 is an apocalyptic number.
10101012151 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101012151 is an equidigital number, since it uses as much as digits as its factorization.
10101012151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 13.
Adding to 10101012151 its reverse (15121010101), we get a palindrome (25222022252).
The spelling of 10101012151 in words is "ten billion, one hundred one million, twelve thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •