Base | Representation |
---|---|
bin | 100110001001… |
… | …1011001101110 |
3 | 1101122020011011 |
4 | 1030103121232 |
5 | 20110034124 |
6 | 1552415434 |
7 | 332006035 |
oct | 114233156 |
9 | 41566134 |
10 | 20002414 |
11 | 10322123 |
12 | 684757a |
13 | 41b4563 |
14 | 292971c |
15 | 1b51994 |
hex | 131366e |
20002414 has 4 divisors (see below), whose sum is σ = 30003624. Its totient is φ = 10001206.
The previous prime is 20002399. The next prime is 20002417. The reversal of 20002414 is 41420002.
It is a semiprime because it is the product of two primes.
It is a Smith number, since the sum of its digits (13) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 20002394 and 20002403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002417) 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 as a sum of consecutive naturals, namely, 5000602 + ... + 5000605.
It is an arithmetic number, because the mean of its divisors is an integer number (7500906).
Almost surely, 220002414 is an apocalyptic number.
20002414 is a deficient number, since it is larger than the sum of its proper divisors (10001210).
20002414 is a wasteful number, since it uses less digits than its factorization.
20002414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10001209.
The product of its (nonzero) digits is 64, while the sum is 13.
The square root of 20002414 is about 4472.4058402609. The cubic root of 20002414 is about 271.4526822270.
Adding to 20002414 its reverse (41420002), we get a palindrome (61422416).
It can be divided in two parts, 20002 and 414, that multiplied together give a palindrome (8280828).
The spelling of 20002414 in words is "twenty million, two thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •