Base | Representation |
---|---|
bin | 101110110101101001… |
… | …0000011001101101000 |
3 | 100121121212210210222110 |
4 | 1131223102003031220 |
5 | 3121444020013142 |
6 | 114112511122320 |
7 | 10160366045310 |
oct | 1355322031550 |
9 | 317555723873 |
10 | 100584141672 |
11 | 39726142413 |
12 | 175b15133a0 |
13 | 963c8450c1 |
14 | 4c2287a440 |
15 | 293a67399c |
hex | 176b483368 |
100584141672 has 128 divisors (see below), whose sum is σ = 304470835200. Its totient is φ = 27031600128.
The previous prime is 100584141653. The next prime is 100584141701. The reversal of 100584141672 is 276141485001.
It is a self number, because there is not a number n which added to its sum of digits gives 100584141672.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5196829 + ... + 5216147.
It is an arithmetic number, because the mean of its divisors is an integer number (2378678400).
Almost surely, 2100584141672 is an apocalyptic number.
100584141672 is a gapful number since it is divisible by the number (12) 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 100584141672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152235417600).
100584141672 is an abundant number, since it is smaller than the sum of its proper divisors (203886693528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100584141672 is a wasteful number, since it uses less digits than its factorization.
100584141672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21175 (or 21171 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 39.
The spelling of 100584141672 in words is "one hundred billion, five hundred eighty-four million, one hundred forty-one thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •