Base | Representation |
---|---|
bin | 110000110000101100… |
… | …0100111010101111000 |
3 | 101000021122002110220200 |
4 | 1201201120213111320 |
5 | 3203423020321111 |
6 | 120034324122200 |
7 | 10364613206244 |
oct | 1414130472570 |
9 | 330248073820 |
10 | 104713057656 |
11 | 40454878079 |
12 | 18364236360 |
13 | 9b4a092a5c |
14 | 50d4d8b424 |
15 | 2accdb1256 |
hex | 1861627578 |
104713057656 has 96 divisors (see below), whose sum is σ = 292636562400. Its totient is φ = 33804334080.
The previous prime is 104713057609. The next prime is 104713057667. The reversal of 104713057656 is 656750317401.
104713057656 is a `hidden beast` number, since 1 + 0 + 4 + 71 + 3 + 0 + 576 + 5 + 6 = 666.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 274965 + ... + 533883.
It is an arithmetic number, because the mean of its divisors is an integer number (3048297525).
Almost surely, 2104713057656 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 104713057656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146318281200).
104713057656 is an abundant number, since it is smaller than the sum of its proper divisors (187923504744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104713057656 is a wasteful number, since it uses less digits than its factorization.
104713057656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259109 (or 259102 counting only the distinct ones).
The product of its (nonzero) digits is 529200, while the sum is 45.
The spelling of 104713057656 in words is "one hundred four billion, seven hundred thirteen million, fifty-seven thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •