Base | Representation |
---|---|
bin | 100110011010… |
… | …0010100100000 |
3 | 1101220002010000 |
4 | 1030310110200 |
5 | 20123342443 |
6 | 1555340000 |
7 | 333110115 |
oct | 114642440 |
9 | 41802100 |
10 | 20137248 |
11 | 1040445a |
12 | 68b1600 |
13 | 4230a41 |
14 | 296290c |
15 | 1b7b8d3 |
hex | 1334520 |
20137248 has 120 divisors (see below), whose sum is σ = 62844012. Its totient is φ = 6303744.
The previous prime is 20137241. The next prime is 20137253. The reversal of 20137248 is 84273102.
It can be written as a sum of positive squares in 2 ways, for example, as 17740944 + 2396304 = 4212^2 + 1548^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (20137241) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 43836 + ... + 44292.
Almost surely, 220137248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20137248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31422006).
20137248 is an abundant number, since it is smaller than the sum of its proper divisors (42706764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20137248 is a wasteful number, since it uses less digits than its factorization.
20137248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496 (or 479 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 20137248 is about 4487.4545123043. The cubic root of 20137248 is about 272.0612607114.
It can be divided in two parts, 2013 and 7248, that added together give a cube (9261 = 213).
The spelling of 20137248 in words is "twenty million, one hundred thirty-seven thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •