Base | Representation |
---|---|
bin | 10010110101100100… |
… | …00100110101100111 |
3 | 222002210102012010201 |
4 | 21122302010311213 |
5 | 131202412323142 |
6 | 4351300531331 |
7 | 505416114136 |
oct | 113262046547 |
9 | 28083365121 |
10 | 10113011047 |
11 | 431a592977 |
12 | 1b629b0b47 |
13 | c52238209 |
14 | 6bd17d91d |
15 | 3e2c82ab7 |
hex | 25ac84d67 |
10113011047 has 2 divisors, whose sum is σ = 10113011048. Its totient is φ = 10113011046.
The previous prime is 10113010987. The next prime is 10113011057. The reversal of 10113011047 is 74011031101.
It is a happy number.
10113011047 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 a cyclic number.
It is not a de Polignac number, because 10113011047 - 219 = 10112486759 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10113011057) 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, 5056505523 + 5056505524.
It is an arithmetic number, because the mean of its divisors is an integer number (5056505524).
Almost surely, 210113011047 is an apocalyptic number.
10113011047 is a deficient number, since it is larger than the sum of its proper divisors (1).
10113011047 is an equidigital number, since it uses as much as digits as its factorization.
10113011047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 10113011047 its reverse (74011031101), we get a palindrome (84124042148).
The spelling of 10113011047 in words is "ten billion, one hundred thirteen million, eleven thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •