Base | Representation |
---|---|
bin | 10111101001100010101100… |
… | …001001100011101010101000 |
3 | 111122021020111220222012110021 |
4 | 113221202230021203222220 |
5 | 102113044100423221342 |
6 | 1005113241104330224 |
7 | 30623314130534422 |
oct | 2751425411435250 |
9 | 448236456865407 |
10 | 104009816226472 |
11 | 30160351803002 |
12 | b7b9971013974 |
13 | 46061118364c0 |
14 | 1b9815db17812 |
15 | c05802436567 |
hex | 5e98ac263aa8 |
104009816226472 has 64 divisors (see below), whose sum is σ = 211115236182480. Its totient is φ = 47754167058432.
The previous prime is 104009816226431. The next prime is 104009816226517. The reversal of 104009816226472 is 274622618900401.
It can be written as a sum of positive squares in 8 ways, for example, as 50878633321476 + 53131182904996 = 7132926^2 + 7289114^2 .
It is a Harshad number since it is a multiple of its sum of digits (52).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 739723408 + ... + 739864000.
Almost surely, 2104009816226472 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 104009816226472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105557618091240).
104009816226472 is an abundant number, since it is smaller than the sum of its proper divisors (107105419956008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104009816226472 is a wasteful number, since it uses less digits than its factorization.
104009816226472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 177662 (or 177658 counting only the distinct ones).
The product of its (nonzero) digits is 2322432, while the sum is 52.
The spelling of 104009816226472 in words is "one hundred four trillion, nine billion, eight hundred sixteen million, two hundred twenty-six thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •