Base | Representation |
---|---|
bin | 100111100101… |
… | …0101011111001 |
3 | 1110001100222000 |
4 | 1033022223321 |
5 | 20303100040 |
6 | 2020451213 |
7 | 341253540 |
oct | 117125371 |
9 | 43040860 |
10 | 20753145 |
11 | 10795166 |
12 | 6b49b09 |
13 | 43b818a |
14 | 2a83157 |
15 | 1c4e130 |
hex | 13caaf9 |
20753145 has 32 divisors (see below), whose sum is σ = 42167040. Its totient is φ = 9486720.
The previous prime is 20753143. The next prime is 20753147. The reversal of 20753145 is 54135702.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20753143) and next prime (20753147).
It is not a de Polignac number, because 20753145 - 21 = 20753143 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 3.
It is not an unprimeable number, because it can be changed into a prime (20753143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10036 + ... + 11925.
It is an arithmetic number, because the mean of its divisors is an integer number (1317720).
Almost surely, 220753145 is an apocalyptic number.
It is an amenable number.
20753145 is an abundant number, since it is smaller than the sum of its proper divisors (21413895).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20753145 is a wasteful number, since it uses less digits than its factorization.
20753145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21982 (or 21976 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 20753145 is about 4555.5619850903. The cubic root of 20753145 is about 274.8071154314.
Adding to 20753145 its reverse (54135702), we get a palindrome (74888847).
The spelling of 20753145 in words is "twenty million, seven hundred fifty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •