Base | Representation |
---|---|
bin | 101000000101… |
… | …111010101001 |
3 | 201202222000000 |
4 | 220011322221 |
5 | 10142304433 |
6 | 1013133213 |
7 | 155222244 |
oct | 50057251 |
9 | 21688000 |
10 | 10509993 |
11 | 5a2934a |
12 | 362a209 |
13 | 223ca40 |
14 | 157825b |
15 | dc9113 |
hex | a05ea9 |
10509993 has 28 divisors (see below), whose sum is σ = 16985220. Its totient is φ = 6461856.
The previous prime is 10509991. The next prime is 10509997. The reversal of 10509993 is 39990501.
It can be written as a sum of positive squares in 2 ways, for example, as 700569 + 9809424 = 837^2 + 3132^2 .
It is not a de Polignac number, because 10509993 - 21 = 10509991 is a prime.
It is a super-2 number, since 2×105099932 = 220919905720098, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10509991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 8923 + ... + 10031.
It is an arithmetic number, because the mean of its divisors is an integer number (606615).
Almost surely, 210509993 is an apocalyptic number.
10509993 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10509993 is a deficient number, since it is larger than the sum of its proper divisors (6475227).
10509993 is an equidigital number, since it uses as much as digits as its factorization.
10509993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1140 (or 1125 counting only the distinct ones).
The product of its (nonzero) digits is 10935, while the sum is 36.
The square root of 10509993 is about 3241.9119358798. The cubic root of 10509993 is about 219.0454024838.
The spelling of 10509993 in words is "ten million, five hundred nine thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •