Base | Representation |
---|---|
bin | 10011110100110000… |
… | …00010000111000111 |
3 | 1000110201210012210222 |
4 | 21322120002013013 |
5 | 133244110230142 |
6 | 4520033334555 |
7 | 524513322002 |
oct | 117230020707 |
9 | 30421705728 |
10 | 10643055047 |
11 | 45717aa869 |
12 | 209040745b |
13 | 1007cac311 |
14 | 72d716539 |
15 | 424582bd2 |
hex | 27a6021c7 |
10643055047 has 2 divisors, whose sum is σ = 10643055048. Its totient is φ = 10643055046.
The previous prime is 10643055023. The next prime is 10643055061. The reversal of 10643055047 is 74055034601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10643055047 - 220 = 10642006471 is a prime.
It is a super-2 number, since 2×106430550472 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10643054998 and 10643055016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10643055077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5321527523 + 5321527524.
It is an arithmetic number, because the mean of its divisors is an integer number (5321527524).
Almost surely, 210643055047 is an apocalyptic number.
10643055047 is a deficient number, since it is larger than the sum of its proper divisors (1).
10643055047 is an equidigital number, since it uses as much as digits as its factorization.
10643055047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50400, while the sum is 35.
Adding to 10643055047 its reverse (74055034601), we get a palindrome (84698089648).
The spelling of 10643055047 in words is "ten billion, six hundred forty-three million, fifty-five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •