Base | Representation |
---|---|
bin | 100111111001… |
… | …000000111011 |
3 | 201200021111202 |
4 | 213321000323 |
5 | 10134112042 |
6 | 1012044415 |
7 | 154612211 |
oct | 47710073 |
9 | 21607452 |
10 | 10457147 |
11 | 59a2678 |
12 | 360370b |
13 | 222197c |
14 | 1562cb1 |
15 | db8632 |
hex | 9f903b |
10457147 has 2 divisors, whose sum is σ = 10457148. Its totient is φ = 10457146.
The previous prime is 10457131. The next prime is 10457149. The reversal of 10457147 is 74175401.
10457147 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 (74175401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10457147 - 24 = 10457131 is a prime.
Together with 10457149, it forms a pair of twin primes.
It is a Chen prime.
It is a nialpdrome in base 15.
It is not a weakly prime, because it can be changed into another prime (10457149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5228573 + 5228574.
It is an arithmetic number, because the mean of its divisors is an integer number (5228574).
Almost surely, 210457147 is an apocalyptic number.
10457147 is a deficient number, since it is larger than the sum of its proper divisors (1).
10457147 is an equidigital number, since it uses as much as digits as its factorization.
10457147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3920, while the sum is 29.
The square root of 10457147 is about 3233.7512272901. The cubic root of 10457147 is about 218.6776531367.
It can be divided in two parts, 1045 and 7147, that added together give a 13-th power (8192 = 213).
The spelling of 10457147 in words is "ten million, four hundred fifty-seven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •