Base | Representation |
---|---|
bin | 100110110011… |
… | …1101000001101 |
3 | 1102021202101121 |
4 | 1031213220031 |
5 | 20202104110 |
6 | 2004040541 |
7 | 334643611 |
oct | 115475015 |
9 | 42252347 |
10 | 20347405 |
11 | 10538341 |
12 | 6993151 |
13 | 42a55b0 |
14 | 29b9341 |
15 | 1bbdcda |
hex | 1367a0d |
20347405 has 8 divisors (see below), whose sum is σ = 26295192. Its totient is φ = 15025728.
The previous prime is 20347361. The next prime is 20347409. The reversal of 20347405 is 50474302.
It can be written as a sum of positive squares in 4 ways, for example, as 259081 + 20088324 = 509^2 + 4482^2 .
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 20347405 - 211 = 20345357 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20347405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20347409) 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, 156454 + ... + 156583.
It is an arithmetic number, because the mean of its divisors is an integer number (3286899).
Almost surely, 220347405 is an apocalyptic number.
It is an amenable number.
20347405 is a deficient number, since it is larger than the sum of its proper divisors (5947787).
20347405 is a wasteful number, since it uses less digits than its factorization.
20347405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313055.
The product of its (nonzero) digits is 3360, while the sum is 25.
The square root of 20347405 is about 4510.8097942609. The cubic root of 20347405 is about 273.0044187900.
The spelling of 20347405 in words is "twenty million, three hundred forty-seven thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •