Base | Representation |
---|---|
bin | 110000101001101010… |
… | …0010011110100000000 |
3 | 100222200011222221121200 |
4 | 1201103110103310000 |
5 | 3202432111014224 |
6 | 115555053421200 |
7 | 10356016153524 |
oct | 1412324236400 |
9 | 328604887550 |
10 | 104477048064 |
11 | 4034362a624 |
12 | 182b919a800 |
13 | 9b1020b2cc |
14 | 50b18b3d84 |
15 | 2ab72e25c9 |
hex | 1853513d00 |
104477048064 has 108 divisors (see below), whose sum is σ = 301934872512. Its totient is φ = 34744550400.
The previous prime is 104477048059. The next prime is 104477048101. The reversal of 104477048064 is 460840774401.
It is a happy number.
104477048064 is a `hidden beast` number, since 1 + 0 + 4 + 47 + 70 + 480 + 64 = 666.
It is a super-2 number, since 2×1044770480642 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 940419 + ... + 1045629.
It is an arithmetic number, because the mean of its divisors is an integer number (2795693264).
Almost surely, 2104477048064 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 104477048064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150967436256).
104477048064 is an abundant number, since it is smaller than the sum of its proper divisors (197457824448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104477048064 is a wasteful number, since it uses less digits than its factorization.
104477048064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105664 (or 105647 counting only the distinct ones).
The product of its (nonzero) digits is 602112, while the sum is 45.
The spelling of 104477048064 in words is "one hundred four billion, four hundred seventy-seven million, forty-eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •