Base | Representation |
---|---|
bin | 10100010100100001… |
… | …11110101100101101 |
3 | 1001011022102012200221 |
4 | 22022100332230231 |
5 | 134320332012032 |
6 | 5002315251341 |
7 | 534231265015 |
oct | 121220765455 |
9 | 31138365627 |
10 | 10909641517 |
11 | 4699232165 |
12 | 2145749b51 |
13 | 104b2ab4a8 |
14 | 756cacc45 |
15 | 43cb91597 |
hex | 28a43eb2d |
10909641517 has 2 divisors, whose sum is σ = 10909641518. Its totient is φ = 10909641516.
The previous prime is 10909641493. The next prime is 10909641577. The reversal of 10909641517 is 71514690901.
It is a happy number.
10909641517 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9375274276 + 1534367241 = 96826^2 + 39171^2 .
It is a cyclic number.
It is not a de Polignac number, because 10909641517 - 27 = 10909641389 is a prime.
It is a super-2 number, since 2×109096415172 (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 (10909641577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5454820758 + 5454820759.
It is an arithmetic number, because the mean of its divisors is an integer number (5454820759).
Almost surely, 210909641517 is an apocalyptic number.
It is an amenable number.
10909641517 is a deficient number, since it is larger than the sum of its proper divisors (1).
10909641517 is an equidigital number, since it uses as much as digits as its factorization.
10909641517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 43.
The spelling of 10909641517 in words is "ten billion, nine hundred nine million, six hundred forty-one thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •