Base | Representation |
---|---|
bin | 100110011011… |
… | …1111011110010 |
3 | 1101220211102020 |
4 | 1030313323302 |
5 | 20124331200 |
6 | 1555532310 |
7 | 333201222 |
oct | 114677362 |
9 | 41824366 |
10 | 20152050 |
11 | 10414596 |
12 | 68ba096 |
13 | 42376b9 |
14 | 2968082 |
15 | 1b80ea0 |
hex | 1337ef2 |
20152050 has 48 divisors (see below), whose sum is σ = 51341952. Its totient is φ = 5227200.
The previous prime is 20152039. The next prime is 20152051. The reversal of 20152050 is 5025102.
It is a super-2 number, since 2×201520502 = 812210238405000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20152051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3735 + ... + 7365.
It is an arithmetic number, because the mean of its divisors is an integer number (1069624).
Almost surely, 220152050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20152050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25670976).
20152050 is an abundant number, since it is smaller than the sum of its proper divisors (31189902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20152050 is a wasteful number, since it uses less digits than its factorization.
20152050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3683 (or 3678 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 15.
The square root of 20152050 is about 4489.1034739689. The cubic root of 20152050 is about 272.1279044501.
Adding to 20152050 its reverse (5025102), we get a palindrome (25177152).
The spelling of 20152050 in words is "twenty million, one hundred fifty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •