Base | Representation |
---|---|
bin | 101001001010… |
… | …010010000101 |
3 | 202022012010102 |
4 | 221022102011 |
5 | 10230240041 |
6 | 1023133445 |
7 | 160466534 |
oct | 51122205 |
9 | 22265112 |
10 | 10790021 |
11 | 60aa780 |
12 | 3744285 |
13 | 230a338 |
14 | 160c31b |
15 | e3209b |
hex | a4a485 |
10790021 has 4 divisors (see below), whose sum is σ = 11770944. Its totient is φ = 9809100.
The previous prime is 10790009. The next prime is 10790027. The reversal of 10790021 is 12009701.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10790021 - 210 = 10788997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10789975 and 10790002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10790027) 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, 490445 + ... + 490466.
It is an arithmetic number, because the mean of its divisors is an integer number (2942736).
Almost surely, 210790021 is an apocalyptic number.
10790021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10790021 is a deficient number, since it is larger than the sum of its proper divisors (980923).
10790021 is an equidigital number, since it uses as much as digits as its factorization.
10790021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 980922.
The product of its (nonzero) digits is 126, while the sum is 20.
The square root of 10790021 is about 3284.8167376583. The cubic root of 10790021 is about 220.9737894019.
Adding to 10790021 its reverse (12009701), we get a palindrome (22799722).
The spelling of 10790021 in words is "ten million, seven hundred ninety thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •