Base | Representation |
---|---|
bin | 100110001001… |
… | …1111100001101 |
3 | 1101122100011220 |
4 | 1030103330031 |
5 | 20110121441 |
6 | 1552433553 |
7 | 332015340 |
oct | 114237415 |
9 | 41570156 |
10 | 20004621 |
11 | 1032384a |
12 | 68488b9 |
13 | 41b5570 |
14 | 292a457 |
15 | 1b52466 |
hex | 1313f0d |
20004621 has 16 divisors (see below), whose sum is σ = 32828544. Its totient is φ = 10551744.
The previous prime is 20004583. The next prime is 20004667. The reversal of 20004621 is 12640002.
It is not a de Polignac number, because 20004621 - 210 = 20003597 is a prime.
It is a super-2 number, since 2×200046212 = 800369722707282, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20004621.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20004221) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 36366 + ... + 36911.
It is an arithmetic number, because the mean of its divisors is an integer number (2051784).
Almost surely, 220004621 is an apocalyptic number.
20004621 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20004621 is a deficient number, since it is larger than the sum of its proper divisors (12823923).
20004621 is a wasteful number, since it uses less digits than its factorization.
20004621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73300.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 20004621 is about 4472.6525686666. The cubic root of 20004621 is about 271.4626655893.
Adding to 20004621 its reverse (12640002), we get a palindrome (32644623).
The spelling of 20004621 in words is "twenty million, four thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •