Base | Representation |
---|---|
bin | 10011100101000011… |
… | …10111000010011011 |
3 | 1000010120002010102112 |
4 | 21302201313002123 |
5 | 133011410212103 |
6 | 4455012022535 |
7 | 521324353061 |
oct | 116241670233 |
9 | 30116063375 |
10 | 10511413403 |
11 | 4504467517 |
12 | 2054301a4b |
13 | cb693a55a |
14 | 71a04a031 |
15 | 417c2ccd8 |
hex | 27287709b |
10511413403 has 2 divisors, whose sum is σ = 10511413404. Its totient is φ = 10511413402.
The previous prime is 10511413373. The next prime is 10511413447. The reversal of 10511413403 is 30431411501.
It is a happy number.
10511413403 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (30431411501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10511413403 - 214 = 10511397019 is a prime.
It is a super-2 number, since 2×105114134032 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10511413303) 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, 5255706701 + 5255706702.
It is an arithmetic number, because the mean of its divisors is an integer number (5255706702).
Almost surely, 210511413403 is an apocalyptic number.
10511413403 is a deficient number, since it is larger than the sum of its proper divisors (1).
10511413403 is an equidigital number, since it uses as much as digits as its factorization.
10511413403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 10511413403 its reverse (30431411501), we get a palindrome (40942824904).
The spelling of 10511413403 in words is "ten billion, five hundred eleven million, four hundred thirteen thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •