Base | Representation |
---|---|
bin | 101000110010… |
… | …110110000101 |
3 | 202010022102212 |
4 | 220302312011 |
5 | 10214202041 |
6 | 1021113205 |
7 | 156616622 |
oct | 50626605 |
9 | 22108385 |
10 | 10694021 |
11 | 6044638 |
12 | 36b8805 |
13 | 22a5730 |
14 | 15c5349 |
15 | e138eb |
hex | a32d85 |
10694021 has 8 divisors (see below), whose sum is σ = 11555544. Its totient is φ = 9838080.
The previous prime is 10694009. The next prime is 10694029. The reversal of 10694021 is 12049601.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 261121 + 10432900 = 511^2 + 3230^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10694021 is a prime.
It is a super-2 number, since 2×106940212 = 228724170296882, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10694029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3161 + ... + 5601.
It is an arithmetic number, because the mean of its divisors is an integer number (1444443).
Almost surely, 210694021 is an apocalyptic number.
It is an amenable number.
10694021 is a deficient number, since it is larger than the sum of its proper divisors (861523).
10694021 is a wasteful number, since it uses less digits than its factorization.
10694021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2791.
The product of its (nonzero) digits is 432, while the sum is 23.
The square root of 10694021 is about 3270.1714022357. The cubic root of 10694021 is about 220.3164935077.
The spelling of 10694021 in words is "ten million, six hundred ninety-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •