Base | Representation |
---|---|
bin | 101000001000… |
… | …110110011001 |
3 | 201210120111001 |
4 | 220020312121 |
5 | 10143201014 |
6 | 1013305001 |
7 | 155302261 |
oct | 50106631 |
9 | 21716431 |
10 | 10522009 |
11 | 5a37383 |
12 | 3635161 |
13 | 2245354 |
14 | 157c7a1 |
15 | dcc974 |
hex | a08d99 |
10522009 has 4 divisors (see below), whose sum is σ = 10529316. Its totient is φ = 10514704.
The previous prime is 10522007. The next prime is 10522013. The reversal of 10522009 is 90022501.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 90022501 = 179 ⋅502919.
It can be written as a sum of positive squares in 2 ways, for example, as 7441984 + 3080025 = 2728^2 + 1755^2 .
It is a cyclic number.
It is not a de Polignac number, because 10522009 - 21 = 10522007 is a prime.
It is a super-2 number, since 2×105220092 = 221425346792162, which contains 22 as substring.
It is a Duffinian number.
It is a nialpdrome in base 15.
It is not an unprimeable number, because it can be changed into a prime (10522007) 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, 694 + ... + 4639.
It is an arithmetic number, because the mean of its divisors is an integer number (2632329).
Almost surely, 210522009 is an apocalyptic number.
It is an amenable number.
10522009 is a deficient number, since it is larger than the sum of its proper divisors (7307).
10522009 is an equidigital number, since it uses as much as digits as its factorization.
10522009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7306.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 10522009 is about 3243.7646338784. The cubic root of 10522009 is about 219.1288483727.
The spelling of 10522009 in words is "ten million, five hundred twenty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •