Base | Representation |
---|---|
bin | 10010101111101011… |
… | …101111010110110110 |
3 | 1220221201011020001220 |
4 | 102233223233112312 |
5 | 312210100120100 |
6 | 13125114531210 |
7 | 1311526431210 |
oct | 225753572666 |
9 | 56851136056 |
10 | 20127348150 |
11 | 85993aa628 |
12 | 3a98736b06 |
13 | 1b89ba5380 |
14 | d8d1955b0 |
15 | 7cc023aa0 |
hex | 4afaef5b6 |
20127348150 has 384 divisors, whose sum is σ = 63475937280. Its totient is φ = 4107939840.
The previous prime is 20127348113. The next prime is 20127348151. The reversal of 20127348150 is 5184372102.
It is a super-2 number, since 2×201273481502 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20127348151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 87892236 + ... + 87892464.
It is an arithmetic number, because the mean of its divisors is an integer number (165301920).
Almost surely, 220127348150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20127348150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31737968640).
20127348150 is an abundant number, since it is smaller than the sum of its proper divisors (43348589130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20127348150 is a wasteful number, since it uses less digits than its factorization.
20127348150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448 (or 443 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 33.
The spelling of 20127348150 in words is "twenty billion, one hundred twenty-seven million, three hundred forty-eight thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •