Base | Representation |
---|---|
bin | 10010101000000111… |
… | …00111010111000111 |
3 | 221210221002012010002 |
4 | 21110003213113013 |
5 | 130440020342031 |
6 | 4332150151515 |
7 | 502546012613 |
oct | 112403472707 |
9 | 27727065102 |
10 | 10000168391 |
11 | 427191a584 |
12 | 1b3105259b |
13 | c34a49005 |
14 | 6ac1a8343 |
15 | 3d7de2ccb |
hex | 2540e75c7 |
10000168391 has 2 divisors, whose sum is σ = 10000168392. Its totient is φ = 10000168390.
The previous prime is 10000168379. The next prime is 10000168403. The reversal of 10000168391 is 19386100001.
It is a happy number.
10000168391 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (10000168379) and next prime (10000168403).
It is an emirp because it is prime and its reverse (19386100001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10000168391 - 26 = 10000168327 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000158391) 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, 5000084195 + 5000084196.
It is an arithmetic number, because the mean of its divisors is an integer number (5000084196).
Almost surely, 210000168391 is an apocalyptic number.
10000168391 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000168391 is an equidigital number, since it uses as much as digits as its factorization.
10000168391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 29.
Adding to 10000168391 its reverse (19386100001), we get a palindrome (29386268392).
The spelling of 10000168391 in words is "ten billion, one hundred sixty-eight thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •