Base | Representation |
---|---|
bin | 100110011000… |
… | …1010001001011 |
3 | 1101212102222000 |
4 | 1030301101023 |
5 | 20122442442 |
6 | 1555202043 |
7 | 333025506 |
oct | 114612113 |
9 | 41772860 |
10 | 20124747 |
11 | 103a6025 |
12 | 68a6323 |
13 | 4228146 |
14 | 295c13d |
15 | 1b77d4c |
hex | 133144b |
20124747 has 24 divisors (see below), whose sum is σ = 31189200. Its totient is φ = 12824064.
The previous prime is 20124733. The next prime is 20124757. The reversal of 20124747 is 74742102.
It is a happy number.
It is not a de Polignac number, because 20124747 - 27 = 20124619 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 20124747.
It is not an unprimeable number, because it can be changed into a prime (20124757) 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 23 ways as a sum of consecutive naturals, for example, 13579 + ... + 14987.
It is an arithmetic number, because the mean of its divisors is an integer number (1299550).
Almost surely, 220124747 is an apocalyptic number.
20124747 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
20124747 is a deficient number, since it is larger than the sum of its proper divisors (11064453).
20124747 is a wasteful number, since it uses less digits than its factorization.
20124747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1464 (or 1435 counting only the distinct ones).
The product of its (nonzero) digits is 3136, while the sum is 27.
The square root of 20124747 is about 4486.0614128654. The cubic root of 20124747 is about 272.0049514309.
Adding to 20124747 its reverse (74742102), we get a palindrome (94866849).
The spelling of 20124747 in words is "twenty million, one hundred twenty-four thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •