Base | Representation |
---|---|
bin | 10011110100110111… |
… | …01001000111110111 |
3 | 1000110210120021210022 |
4 | 21322123221013313 |
5 | 133244331020041 |
6 | 4520105515355 |
7 | 524524342451 |
oct | 117233510767 |
9 | 30423507708 |
10 | 10644001271 |
11 | 4572296772 |
12 | 20907a2b5b |
13 | 1008250c07 |
14 | 72d8c12d1 |
15 | 4246bd24b |
hex | 27a6e91f7 |
10644001271 has 2 divisors, whose sum is σ = 10644001272. Its totient is φ = 10644001270.
The previous prime is 10644001261. The next prime is 10644001327. The reversal of 10644001271 is 17210044601.
It is a weak prime.
It is an emirp because it is prime and its reverse (17210044601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10644001271 - 210 = 10644000247 is a prime.
It is a super-2 number, since 2×106440012712 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10644001271.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10644001201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5322000635 + 5322000636.
It is an arithmetic number, because the mean of its divisors is an integer number (5322000636).
Almost surely, 210644001271 is an apocalyptic number.
10644001271 is a deficient number, since it is larger than the sum of its proper divisors (1).
10644001271 is an equidigital number, since it uses as much as digits as its factorization.
10644001271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 26.
Adding to 10644001271 its reverse (17210044601), we get a palindrome (27854045872).
The spelling of 10644001271 in words is "ten billion, six hundred forty-four million, one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •