Base | Representation |
---|---|
bin | 100110100111… |
… | …110011011101 |
3 | 201001101012211 |
4 | 212213303131 |
5 | 10042441014 |
6 | 1001000421 |
7 | 152025343 |
oct | 46476335 |
9 | 21041184 |
10 | 10124509 |
11 | 579576a |
12 | 3483111 |
13 | 2136445 |
14 | 14b7993 |
15 | d4ecc4 |
hex | 9a7cdd |
10124509 has 4 divisors (see below), whose sum is σ = 10473660. Its totient is φ = 9775360.
The previous prime is 10124497. The next prime is 10124533. The reversal of 10124509 is 90542101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 90542101 = 13 ⋅6964777.
It can be written as a sum of positive squares in 2 ways, for example, as 6775609 + 3348900 = 2603^2 + 1830^2 .
It is a cyclic number.
It is not a de Polignac number, because 10124509 - 217 = 9993437 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10124509.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10124539) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 174532 + ... + 174589.
It is an arithmetic number, because the mean of its divisors is an integer number (2618415).
Almost surely, 210124509 is an apocalyptic number.
It is an amenable number.
10124509 is a deficient number, since it is larger than the sum of its proper divisors (349151).
10124509 is an equidigital number, since it uses as much as digits as its factorization.
10124509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349150.
The product of its (nonzero) digits is 360, while the sum is 22.
The square root of 10124509 is about 3181.9033611975. The cubic root of 10124509 is about 216.3339384795. Note that the first 3 decimals are identical.
The spelling of 10124509 in words is "ten million, one hundred twenty-four thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •