Base | Representation |
---|---|
bin | 101110110000101001… |
… | …0111110110100010010 |
3 | 100121012012120111201220 |
4 | 1131201102332310102 |
5 | 3121123123114100 |
6 | 114044124305510 |
7 | 10153263063363 |
oct | 1354122766422 |
9 | 317165514656 |
10 | 100416613650 |
11 | 3964a619101 |
12 | 175653a2296 |
13 | 9613c19cb2 |
14 | 4c0850bb6a |
15 | 292aad0aa0 |
hex | 17614bed12 |
100416613650 has 96 divisors (see below), whose sum is σ = 261150428160. Its totient is φ = 25500142080.
The previous prime is 100416613607. The next prime is 100416613663. The reversal of 100416613650 is 56316614001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 159439 + ... + 475661.
It is an arithmetic number, because the mean of its divisors is an integer number (2720316960).
Almost surely, 2100416613650 is an apocalyptic number.
100416613650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 100416613650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130575214080).
100416613650 is an abundant number, since it is smaller than the sum of its proper divisors (160733814510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100416613650 is a wasteful number, since it uses less digits than its factorization.
100416613650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316340 (or 316335 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The spelling of 100416613650 in words is "one hundred billion, four hundred sixteen million, six hundred thirteen thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •