Base | Representation |
---|---|
bin | 100110100100… |
… | …0100111110101 |
3 | 1102001022011220 |
4 | 1031020213311 |
5 | 20134023110 |
6 | 2001220553 |
7 | 333604422 |
oct | 115104765 |
9 | 42038156 |
10 | 20220405 |
11 | 10460987 |
12 | 6931759 |
13 | 425c84a |
14 | 2984d49 |
15 | 1b96370 |
hex | 13489f5 |
20220405 has 8 divisors (see below), whose sum is σ = 32352672. Its totient is φ = 10784208.
The previous prime is 20220383. The next prime is 20220407. The reversal of 20220405 is 50402202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20220405 - 25 = 20220373 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 1348027 = 20220405 / (2 + 0 + 2 + 2 + 0 + 4 + 0 + 5).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20220407) 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 7 ways as a sum of consecutive naturals, for example, 673999 + ... + 674028.
It is an arithmetic number, because the mean of its divisors is an integer number (4044084).
Almost surely, 220220405 is an apocalyptic number.
It is an amenable number.
20220405 is a deficient number, since it is larger than the sum of its proper divisors (12132267).
20220405 is a wasteful number, since it uses less digits than its factorization.
20220405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1348035.
The product of its (nonzero) digits is 160, while the sum is 15.
The square root of 20220405 is about 4496.7104643283. The cubic root of 20220405 is about 272.4352397801.
Adding to 20220405 its reverse (50402202), we get a palindrome (70622607).
The spelling of 20220405 in words is "twenty million, two hundred twenty thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •