Base | Representation |
---|---|
bin | 10011100100001100… |
… | …01001100011100001 |
3 | 1000010001102001211121 |
4 | 21302012021203201 |
5 | 133003030233332 |
6 | 4454152212241 |
7 | 521205536512 |
oct | 116206114341 |
9 | 30101361747 |
10 | 10504149217 |
11 | 4500355861 |
12 | 205199a081 |
13 | cb5296013 |
14 | 7190b8a09 |
15 | 417295797 |
hex | 2721898e1 |
10504149217 has 2 divisors, whose sum is σ = 10504149218. Its totient is φ = 10504149216.
The previous prime is 10504149211. The next prime is 10504149223. The reversal of 10504149217 is 71294140501.
It is a balanced prime because it is at equal distance from previous prime (10504149211) and next prime (10504149223).
It can be written as a sum of positive squares in only one way, i.e., 6877219041 + 3626930176 = 82929^2 + 60224^2 .
It is an emirp because it is prime and its reverse (71294140501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10504149217 - 23 = 10504149209 is a prime.
It is a super-2 number, since 2×105041492172 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10504149211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5252074608 + 5252074609.
It is an arithmetic number, because the mean of its divisors is an integer number (5252074609).
Almost surely, 210504149217 is an apocalyptic number.
It is an amenable number.
10504149217 is a deficient number, since it is larger than the sum of its proper divisors (1).
10504149217 is an equidigital number, since it uses as much as digits as its factorization.
10504149217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10080, while the sum is 34.
Adding to 10504149217 its reverse (71294140501), we get a palindrome (81798289718).
The spelling of 10504149217 in words is "ten billion, five hundred four million, one hundred forty-nine thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •