Base | Representation |
---|---|
bin | 100111111100… |
… | …011001101101 |
3 | 201200222112121 |
4 | 213330121231 |
5 | 10140033041 |
6 | 1012232541 |
7 | 155000521 |
oct | 47743155 |
9 | 21628477 |
10 | 10471021 |
11 | 5a02040 |
12 | 360b751 |
13 | 2228092 |
14 | 1567d81 |
15 | dbc7d1 |
hex | 9fc66d |
10471021 has 4 divisors (see below), whose sum is σ = 11422944. Its totient is φ = 9519100.
The previous prime is 10471007. The next prime is 10471057. The reversal of 10471021 is 12017401.
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 10471021 - 27 = 10470893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10470986 and 10471004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10471081) 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, 475945 + ... + 475966.
It is an arithmetic number, because the mean of its divisors is an integer number (2855736).
Almost surely, 210471021 is an apocalyptic number.
10471021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10471021 is a deficient number, since it is larger than the sum of its proper divisors (951923).
10471021 is an equidigital number, since it uses as much as digits as its factorization.
10471021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 951922.
The product of its (nonzero) digits is 56, while the sum is 16.
The square root of 10471021 is about 3235.8957028928. The cubic root of 10471021 is about 218.7743204524.
Adding to 10471021 its reverse (12017401), we get a palindrome (22488422).
The spelling of 10471021 in words is "ten million, four hundred seventy-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •