Base | Representation |
---|---|
bin | 101000110010… |
… | …010110001110 |
3 | 202010012122100 |
4 | 220302112032 |
5 | 10214120412 |
6 | 1021055530 |
7 | 156610650 |
oct | 50622616 |
9 | 22105570 |
10 | 10691982 |
11 | 6043054 |
12 | 36b75a6 |
13 | 22a4822 |
14 | 15c46d0 |
15 | e12edc |
hex | a3258e |
10691982 has 24 divisors (see below), whose sum is σ = 26475696. Its totient is φ = 3054816.
The previous prime is 10691959. The next prime is 10692029. The reversal of 10691982 is 28919601.
It is a super-2 number, since 2×106919822 = 228636958176648, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 42303 + ... + 42554.
It is an arithmetic number, because the mean of its divisors is an integer number (1103154).
Almost surely, 210691982 is an apocalyptic number.
10691982 is an abundant number, since it is smaller than the sum of its proper divisors (15783714).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10691982 is a wasteful number, since it uses less digits than its factorization.
10691982 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84872 (or 84869 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 36.
The square root of 10691982 is about 3269.8596300147. The cubic root of 10691982 is about 220.3024902348.
The spelling of 10691982 in words is "ten million, six hundred ninety-one thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •