Base | Representation |
---|---|
bin | 10011110100111011… |
… | …00110000100101111 |
3 | 1000110211112021211212 |
4 | 21322131212010233 |
5 | 133244443404241 |
6 | 4520124505035 |
7 | 524531603543 |
oct | 117235460457 |
9 | 30424467755 |
10 | 10644513071 |
11 | 4572606245 |
12 | 20909ab17b |
13 | 100839cb5a |
14 | 72d9b5a23 |
15 | 42476ebeb |
hex | 27a76612f |
10644513071 has 2 divisors, whose sum is σ = 10644513072. Its totient is φ = 10644513070.
The previous prime is 10644513053. The next prime is 10644513079. The reversal of 10644513071 is 17031544601.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10644513071 is a prime.
It is a super-2 number, since 2×106445130712 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10644513079) 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, 5322256535 + 5322256536.
It is an arithmetic number, because the mean of its divisors is an integer number (5322256536).
Almost surely, 210644513071 is an apocalyptic number.
10644513071 is a deficient number, since it is larger than the sum of its proper divisors (1).
10644513071 is an equidigital number, since it uses as much as digits as its factorization.
10644513071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 32.
The spelling of 10644513071 in words is "ten billion, six hundred forty-four million, five hundred thirteen thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.484 sec. • engine limits •