Base | Representation |
---|---|
bin | 100110001001… |
… | …1010101101000 |
3 | 1101122012210110 |
4 | 1030103111220 |
5 | 20110032102 |
6 | 1552414320 |
7 | 332005212 |
oct | 114232550 |
9 | 41565713 |
10 | 20002152 |
11 | 10321a05 |
12 | 68473a0 |
13 | 41b43c1 |
14 | 29295b2 |
15 | 1b5186c |
hex | 1313568 |
20002152 has 32 divisors (see below), whose sum is σ = 50479200. Its totient is φ = 6604224.
The previous prime is 20002133. The next prime is 20002159. The reversal of 20002152 is 25120002.
It is a super-2 number, since 2×200021522 = 800172169262208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (20002159) 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 7 ways as a sum of consecutive naturals, for example, 1327 + ... + 6462.
It is an arithmetic number, because the mean of its divisors is an integer number (1577475).
Almost surely, 220002152 is an apocalyptic number.
It is an amenable number.
20002152 is an abundant number, since it is smaller than the sum of its proper divisors (30477048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20002152 is a wasteful number, since it uses less digits than its factorization.
20002152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7905 (or 7901 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 12.
The square root of 20002152 is about 4472.3765494421. The cubic root of 20002152 is about 271.4514970215.
Adding to 20002152 its reverse (25120002), we get a palindrome (45122154).
The spelling of 20002152 in words is "twenty million, two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •