Base | Representation |
---|---|
bin | 10010111001101010… |
… | …01000001111101111 |
3 | 222012012001121002121 |
4 | 21130311020033233 |
5 | 131240211201441 |
6 | 4354525133411 |
7 | 506314121026 |
oct | 113465101757 |
9 | 28165047077 |
10 | 10147365871 |
11 | 4337a18195 |
12 | 1b723ba267 |
13 | c593a6406 |
14 | 6c39638bd |
15 | 3e5cbbdd1 |
hex | 25cd483ef |
10147365871 has 2 divisors, whose sum is σ = 10147365872. Its totient is φ = 10147365870.
The previous prime is 10147365829. The next prime is 10147365961. The reversal of 10147365871 is 17856374101.
It is a weak prime.
It is an emirp because it is prime and its reverse (17856374101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10147365871 - 213 = 10147357679 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10147365071) 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, 5073682935 + 5073682936.
It is an arithmetic number, because the mean of its divisors is an integer number (5073682936).
Almost surely, 210147365871 is an apocalyptic number.
10147365871 is a deficient number, since it is larger than the sum of its proper divisors (1).
10147365871 is an equidigital number, since it uses as much as digits as its factorization.
10147365871 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141120, while the sum is 43.
The spelling of 10147365871 in words is "ten billion, one hundred forty-seven million, three hundred sixty-five thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •