Base | Representation |
---|---|
bin | 100110011100… |
… | …0000101001010 |
3 | 1101220212020110 |
4 | 1030320011022 |
5 | 20124341100 |
6 | 1555535150 |
7 | 333203040 |
oct | 114700512 |
9 | 41825213 |
10 | 20152650 |
11 | 10414a91 |
12 | 68ba4b6 |
13 | 4237a5b |
14 | 2968390 |
15 | 1b81250 |
hex | 133814a |
20152650 has 96 divisors (see below), whose sum is σ = 60531840. Its totient is φ = 4331520.
The previous prime is 20152621. The next prime is 20152703. The reversal of 20152650 is 5625102.
It is a super-2 number, since 2×201526502 = 812258604045000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 17286 + ... + 18414.
It is an arithmetic number, because the mean of its divisors is an integer number (630540).
Almost surely, 220152650 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20152650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30265920).
20152650 is an abundant number, since it is smaller than the sum of its proper divisors (40379190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20152650 is a wasteful number, since it uses less digits than its factorization.
20152650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1168 (or 1163 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 20152650 is about 4489.1703019600. The cubic root of 20152650 is about 272.1306051699.
Adding to 20152650 its reverse (5625102), we get a palindrome (25777752).
It can be divided in two parts, 20152 and 650, that added together give a palindrome (20802).
The spelling of 20152650 in words is "twenty million, one hundred fifty-two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •