Base | Representation |
---|---|
bin | 101110110100101000… |
… | …0000000000011010000 |
3 | 100121112111122202222221 |
4 | 1131221100000003100 |
5 | 3121411303100000 |
6 | 114105252310424 |
7 | 10156503215551 |
oct | 1355120000320 |
9 | 317474582887 |
10 | 100550050000 |
11 | 39708977884 |
12 | 175a2012414 |
13 | 963576990a |
14 | 4c1c124328 |
15 | 293768c61a |
hex | 17694000d0 |
100550050000 has 120 divisors (see below), whose sum is σ = 251362911744. Its totient is φ = 38922000000.
The previous prime is 100550049983. The next prime is 100550050009. The reversal of 100550050000 is 50055001.
It is a super-2 number, since 2×1005500500002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100550050009) 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, 1517565 + ... + 1582435.
Almost surely, 2100550050000 is an apocalyptic number.
100550050000 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 100550050000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125681455872).
100550050000 is an abundant number, since it is smaller than the sum of its proper divisors (150812861744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100550050000 is an frugal number, since it uses more digits than its factorization.
100550050000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64935 (or 64909 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 16.
The spelling of 100550050000 in words is "one hundred billion, five hundred fifty million, fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •