Base | Representation |
---|---|
bin | 100110001100… |
… | …1000001101101 |
3 | 1101200101202110 |
4 | 1030121001231 |
5 | 20111303303 |
6 | 1553114233 |
7 | 332133150 |
oct | 114310155 |
9 | 41611673 |
10 | 20025453 |
11 | 10338468 |
12 | 6858979 |
13 | 41c1ba6 |
14 | 2933c97 |
15 | 1b58703 |
hex | 131906d |
20025453 has 8 divisors (see below), whose sum is σ = 30515008. Its totient is φ = 11443104.
The previous prime is 20025443. The next prime is 20025461. The reversal of 20025453 is 35452002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20025453 - 28 = 20025197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 953593 = 20025453 / (2 + 0 + 0 + 2 + 5 + 4 + 5 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20025403) 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, 476776 + ... + 476817.
It is an arithmetic number, because the mean of its divisors is an integer number (3814376).
Almost surely, 220025453 is an apocalyptic number.
It is an amenable number.
20025453 is a deficient number, since it is larger than the sum of its proper divisors (10489555).
20025453 is an equidigital number, since it uses as much as digits as its factorization.
20025453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 953603.
The product of its (nonzero) digits is 1200, while the sum is 21.
The square root of 20025453 is about 4474.9807820816. The cubic root of 20025453 is about 271.5568629647.
Adding to 20025453 its reverse (35452002), we get a palindrome (55477455).
The spelling of 20025453 in words is "twenty million, twenty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •