Base | Representation |
---|---|
bin | 100111011110… |
… | …0001010001110 |
3 | 1102221100100100 |
4 | 1032330022032 |
5 | 20244144041 |
6 | 2015311530 |
7 | 340615221 |
oct | 116741216 |
9 | 42840310 |
10 | 20693646 |
11 | 10754496 |
12 | 6b1b5a6 |
13 | 439707c |
14 | 2a695b8 |
15 | 1c3b6b6 |
hex | 13bc28e |
20693646 has 36 divisors (see below), whose sum is σ = 46469592. Its totient is φ = 6655152.
The previous prime is 20693639. The next prime is 20693663. The reversal of 20693646 is 64639602.
20693646 is a `hidden beast` number, since 2 + 0 + 6 + 9 + 3 + 646 = 666.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20693646.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 14455 + ... + 15821.
It is an arithmetic number, because the mean of its divisors is an integer number (1290822).
Almost surely, 220693646 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20693646, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23234796).
20693646 is an abundant number, since it is smaller than the sum of its proper divisors (25775946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20693646 is a wasteful number, since it uses less digits than its factorization.
20693646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1433 (or 1401 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 36.
The square root of 20693646 is about 4549.0269289157. The cubic root of 20693646 is about 274.5442412294.
The spelling of 20693646 in words is "twenty million, six hundred ninety-three thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •