Base | Representation |
---|---|
bin | 10010110100100100… |
… | …00000101101000101 |
3 | 222002012121010220111 |
4 | 21122102000231011 |
5 | 131143234334014 |
6 | 4350400433021 |
7 | 505254505165 |
oct | 113222005505 |
9 | 28065533814 |
10 | 10104605509 |
11 | 4315871749 |
12 | 1b60018771 |
13 | c5058431b |
14 | 6bbdd25a5 |
15 | 3e21722c4 |
hex | 25a480b45 |
10104605509 has 4 divisors (see below), whose sum is σ = 10104808140. Its totient is φ = 10104402880.
The previous prime is 10104605507. The next prime is 10104605519. The reversal of 10104605509 is 90550640101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 90550640101 = 5081 ⋅17821421.
It can be written as a sum of positive squares in 2 ways, for example, as 4669672225 + 5434933284 = 68335^2 + 73722^2 .
It is a cyclic number.
It is not a de Polignac number, because 10104605509 - 21 = 10104605507 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10104605507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31677 + ... + 145645.
It is an arithmetic number, because the mean of its divisors is an integer number (2526202035).
Almost surely, 210104605509 is an apocalyptic number.
It is an amenable number.
10104605509 is a deficient number, since it is larger than the sum of its proper divisors (202631).
10104605509 is an equidigital number, since it uses as much as digits as its factorization.
10104605509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202630.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 10104605509 in words is "ten billion, one hundred four million, six hundred five thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •