Base | Representation |
---|---|
bin | 110000100000111011… |
… | …0100111010010111000 |
3 | 100221220202200011000211 |
4 | 1201001312213102320 |
5 | 3201332104111442 |
6 | 115510025440504 |
7 | 10345530551356 |
oct | 1410166472270 |
9 | 327822604024 |
10 | 104184050872 |
11 | 402031a9490 |
12 | 18237040134 |
13 | 9a945c2aa5 |
14 | 5084a047d6 |
15 | 2a9b718617 |
hex | 1841da74b8 |
104184050872 has 64 divisors (see below), whose sum is σ = 218182124160. Its totient is φ = 46229097600.
The previous prime is 104184050869. The next prime is 104184050879. The reversal of 104184050872 is 278050481401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104184050879) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7761847 + ... + 7775257.
It is an arithmetic number, because the mean of its divisors is an integer number (3409095690).
Almost surely, 2104184050872 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104184050872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (109091062080).
104184050872 is an abundant number, since it is smaller than the sum of its proper divisors (113998073288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104184050872 is a wasteful number, since it uses less digits than its factorization.
104184050872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15524 (or 15520 counting only the distinct ones).
The product of its (nonzero) digits is 71680, while the sum is 40.
The spelling of 104184050872 in words is "one hundred four billion, one hundred eighty-four million, fifty thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •