Base | Representation |
---|---|
bin | 10100001011001101… |
… | …01001110011110111 |
3 | 1000221212021000100002 |
4 | 22011212221303313 |
5 | 134140321441142 |
6 | 4550443141515 |
7 | 532261460444 |
oct | 120546516367 |
9 | 30855230302 |
10 | 10831437047 |
11 | 4659077a72 |
12 | 212351489b |
13 | 1038029462 |
14 | 74a7529cb |
15 | 435d94a32 |
hex | 2859a9cf7 |
10831437047 has 2 divisors, whose sum is σ = 10831437048. Its totient is φ = 10831437046.
The previous prime is 10831436999. The next prime is 10831437053. The reversal of 10831437047 is 74073413801.
It is a strong prime.
It is an emirp because it is prime and its reverse (74073413801) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10831437047 - 228 = 10563001591 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10831437047.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10831437247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5415718523 + 5415718524.
It is an arithmetic number, because the mean of its divisors is an integer number (5415718524).
Almost surely, 210831437047 is an apocalyptic number.
10831437047 is a deficient number, since it is larger than the sum of its proper divisors (1).
10831437047 is an equidigital number, since it uses as much as digits as its factorization.
10831437047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56448, while the sum is 38.
The spelling of 10831437047 in words is "ten billion, eight hundred thirty-one million, four hundred thirty-seven thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •