Base | Representation |
---|---|
bin | 100110001100… |
… | …1011001001000 |
3 | 1101200110210222 |
4 | 1030121121020 |
5 | 20111330302 |
6 | 1553125212 |
7 | 332140421 |
oct | 114313110 |
9 | 41613728 |
10 | 20026952 |
11 | 10339600 |
12 | 6859808 |
13 | 41c278a |
14 | 2934648 |
15 | 1b58da2 |
hex | 1319648 |
20026952 has 48 divisors (see below), whose sum is σ = 43738380. Its totient is φ = 8560640.
The previous prime is 20026939. The next prime is 20026957. The reversal of 20026952 is 25962002.
It can be written as a sum of positive squares in 2 ways, for example, as 19945156 + 81796 = 4466^2 + 286^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20026957) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15848 + ... + 17064.
Almost surely, 220026952 is an apocalyptic number.
20026952 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20026952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21869190).
20026952 is an abundant number, since it is smaller than the sum of its proper divisors (23711428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20026952 is a wasteful number, since it uses less digits than its factorization.
20026952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1262 (or 1247 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 20026952 is about 4475.1482657003. The cubic root of 20026952 is about 271.5636385681.
Adding to 20026952 its reverse (25962002), we get a palindrome (45988954).
The spelling of 20026952 in words is "twenty million, twenty-six thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •