Base | Representation |
---|---|
bin | 10011100011101101… |
… | …00000110000111100 |
3 | 1000002202200210202000 |
4 | 21301312200300330 |
5 | 133001003044410 |
6 | 4453524302300 |
7 | 521125644420 |
oct | 116166406074 |
9 | 30082623660 |
10 | 10500049980 |
11 | 44a9005a62 |
12 | 2050541990 |
13 | cb448c234 |
14 | 71872cb80 |
15 | 416c35dc0 |
hex | 271da0c3c |
10500049980 has 192 divisors, whose sum is σ = 38244648960. Its totient is φ = 2341440000.
The previous prime is 10500049979. The next prime is 10500050027. The reversal of 10500049980 is 8994000501.
It is a super-2 number, since 2×105000499802 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 121105 + ... + 188855.
It is an arithmetic number, because the mean of its divisors is an integer number (199190880).
Almost surely, 210500049980 is an apocalyptic number.
10500049980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10500049980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19122324480).
10500049980 is an abundant number, since it is smaller than the sum of its proper divisors (27744598980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10500049980 is a wasteful number, since it uses less digits than its factorization.
10500049980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67817 (or 67809 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 36.
The spelling of 10500049980 in words is "ten billion, five hundred million, forty-nine thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •