Base | Representation |
---|---|
bin | 10011000111101000… |
… | …01000101101011011 |
3 | 222111100112222012112 |
4 | 21203310020231123 |
5 | 132010210434024 |
6 | 4414312502535 |
7 | 512236126331 |
oct | 114364105533 |
9 | 28440488175 |
10 | 10264546139 |
11 | 4398083491 |
12 | 1ba56aaa4b |
13 | c77753a53 |
14 | 6d5347b51 |
15 | 40121700e |
hex | 263d08b5b |
10264546139 has 2 divisors, whose sum is σ = 10264546140. Its totient is φ = 10264546138.
The previous prime is 10264546109. The next prime is 10264546141. The reversal of 10264546139 is 93164546201.
10264546139 is digitally balanced in base 2, 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 (93164546201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10264546139 is a prime.
Together with 10264546141, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10264546096 and 10264546105.
It is not a weakly prime, because it can be changed into another prime (10264546109) 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, 5132273069 + 5132273070.
It is an arithmetic number, because the mean of its divisors is an integer number (5132273070).
Almost surely, 210264546139 is an apocalyptic number.
10264546139 is a deficient number, since it is larger than the sum of its proper divisors (1).
10264546139 is an equidigital number, since it uses as much as digits as its factorization.
10264546139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 41.
The spelling of 10264546139 in words is "ten billion, two hundred sixty-four million, five hundred forty-six thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •