Base | Representation |
---|---|
bin | 100110001100… |
… | …0001011110001 |
3 | 1101200020000121 |
4 | 1030120023301 |
5 | 20111201001 |
6 | 1553050241 |
7 | 332120116 |
oct | 114301361 |
9 | 41606017 |
10 | 20022001 |
11 | 1033590a |
12 | 6856981 |
13 | 41c044c |
14 | 293290d |
15 | 1b576a1 |
hex | 13182f1 |
20022001 has 8 divisors (see below), whose sum is σ = 20772608. Its totient is φ = 19278000.
The previous prime is 20021999. The next prime is 20022011. The reversal of 20022001 is 10022002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20022001 - 21 = 20021999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20022011) 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, 5011 + ... + 8071.
It is an arithmetic number, because the mean of its divisors is an integer number (2596576).
Almost surely, 220022001 is an apocalyptic number.
It is an amenable number.
20022001 is a deficient number, since it is larger than the sum of its proper divisors (750607).
20022001 is a wasteful number, since it uses less digits than its factorization.
20022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3303.
The product of its (nonzero) digits is 8, while the sum is 7.
The square root of 20022001 is about 4474.5950654780. The cubic root of 20022001 is about 271.5412583546.
Adding to 20022001 its reverse (10022002), we get a palindrome (30044003).
Subtracting from 20022001 its reverse (10022002), we obtain a palindrome (9999999).
It can be divided in two parts, 200 and 22001, that added together give a square (22201 = 1492).
The spelling of 20022001 in words is "twenty million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •