Base | Representation |
---|---|
bin | 100110000000… |
… | …1000110111101 |
3 | 1101111102101000 |
4 | 1030001012331 |
5 | 20100134420 |
6 | 1551040513 |
7 | 331244424 |
oct | 114010675 |
9 | 41442330 |
10 | 19927485 |
11 | 102808a6 |
12 | 6810139 |
13 | 4189416 |
14 | 290a2bb |
15 | 1b39690 |
hex | 13011bd |
19927485 has 64 divisors (see below), whose sum is σ = 39571200. Its totient is φ = 9455616.
The previous prime is 19927477. The next prime is 19927493. The reversal of 19927485 is 58472991.
It is an interprime number because it is at equal distance from previous prime (19927477) and next prime (19927493).
It is not a de Polignac number, because 19927485 - 23 = 19927477 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 19927485.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 43377 + ... + 43833.
It is an arithmetic number, because the mean of its divisors is an integer number (618300).
Almost surely, 219927485 is an apocalyptic number.
19927485 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
19927485 is a deficient number, since it is larger than the sum of its proper divisors (19643715).
19927485 is a wasteful number, since it uses less digits than its factorization.
19927485 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 507 (or 501 counting only the distinct ones).
The product of its digits is 181440, while the sum is 45.
The square root of 19927485 is about 4464.0211693046. The cubic root of 19927485 is about 271.1133043820.
The spelling of 19927485 in words is "nineteen million, nine hundred twenty-seven thousand, four hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •