Base | Representation |
---|---|
bin | 10010111010010101… |
… | …01101111001111011 |
3 | 222012120201010011102 |
4 | 21131022231321323 |
5 | 131243133301042 |
6 | 4355250322015 |
7 | 506413201256 |
oct | 113512557173 |
9 | 28176633142 |
10 | 10153025147 |
11 | 4340133081 |
12 | 1b7428930b |
13 | c5a6082b5 |
14 | 6c45d809d |
15 | 3e6538b32 |
hex | 25d2ade7b |
10153025147 has 2 divisors, whose sum is σ = 10153025148. Its totient is φ = 10153025146.
The previous prime is 10153025123. The next prime is 10153025149. The reversal of 10153025147 is 74152035101.
10153025147 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (74152035101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10153025147 - 222 = 10148830843 is a prime.
It is a super-2 number, since 2×101530251472 (a number of 21 digits) contains 22 as substring.
Together with 10153025149, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10153025149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5076512573 + 5076512574.
It is an arithmetic number, because the mean of its divisors is an integer number (5076512574).
Almost surely, 210153025147 is an apocalyptic number.
10153025147 is a deficient number, since it is larger than the sum of its proper divisors (1).
10153025147 is an equidigital number, since it uses as much as digits as its factorization.
10153025147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4200, while the sum is 29.
The spelling of 10153025147 in words is "ten billion, one hundred fifty-three million, twenty-five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •