Base | Representation |
---|---|
bin | 100111001101… |
… | …0101011001100 |
3 | 1102200101012120 |
4 | 1032122223030 |
5 | 20230301432 |
6 | 2012332540 |
7 | 336504315 |
oct | 116325314 |
9 | 42611176 |
10 | 20556492 |
11 | 10670440 |
12 | 6a74150 |
13 | 4349808 |
14 | 2a3160c |
15 | 1c10c2c |
hex | 139aacc |
20556492 has 24 divisors (see below), whose sum is σ = 52325952. Its totient is φ = 6229200.
The previous prime is 20556491. The next prime is 20556493. The reversal of 20556492 is 29465502.
It is an interprime number because it is at equal distance from previous prime (20556491) and next prime (20556493).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a plaindrome in base 16.
It is not an unprimeable number, because it can be changed into a prime (20556491) 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, 77734 + ... + 77997.
It is an arithmetic number, because the mean of its divisors is an integer number (2180248).
Almost surely, 220556492 is an apocalyptic number.
20556492 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
20556492 is an abundant number, since it is smaller than the sum of its proper divisors (31769460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20556492 is a wasteful number, since it uses less digits than its factorization.
20556492 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155749 (or 155747 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 20556492 is about 4533.9267748829. The cubic root of 20556492 is about 273.9363519202.
The spelling of 20556492 in words is "twenty million, five hundred fifty-six thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •