Base | Representation |
---|---|
bin | 101000001000… |
… | …010111000011 |
3 | 201210110201202 |
4 | 220020113003 |
5 | 10143120003 |
6 | 1013251415 |
7 | 155263364 |
oct | 50102703 |
9 | 21713652 |
10 | 10520003 |
11 | 5a3591a |
12 | 3633b6b |
13 | 2244470 |
14 | 157bb6b |
15 | dcc088 |
hex | a085c3 |
10520003 has 4 divisors (see below), whose sum is σ = 11329248. Its totient is φ = 9710760.
The previous prime is 10519981. The next prime is 10520017. The reversal of 10520003 is 30002501.
10520003 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10520003 - 210 = 10518979 is a prime.
It is a super-2 number, since 2×105200032 = 221340926240018, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10520033) 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, 404603 + ... + 404628.
It is an arithmetic number, because the mean of its divisors is an integer number (2832312).
Almost surely, 210520003 is an apocalyptic number.
10520003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10520003 is a deficient number, since it is larger than the sum of its proper divisors (809245).
10520003 is an equidigital number, since it uses as much as digits as its factorization.
10520003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 809244.
The product of its (nonzero) digits is 30, while the sum is 11.
The square root of 10520003 is about 3243.4554105151. The cubic root of 10520003 is about 219.1149219952.
Adding to 10520003 its reverse (30002501), we get a palindrome (40522504).
The spelling of 10520003 in words is "ten million, five hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •