Base | Representation |
---|---|
bin | 11010011011010101000101… |
… | …11101000010101000000000 |
3 | 21121202121110120221012221221 |
4 | 31031222202331002220000 |
5 | 30104113214201103113 |
6 | 323333012135324424 |
7 | 15145400131545412 |
oct | 1515524275025000 |
9 | 247677416835857 |
10 | 58113641425408 |
11 | 17575947624218 |
12 | 6626990b20714 |
13 | 265712906970a |
14 | 104ca029209b2 |
15 | 6aba0871398d |
hex | 34daa2f42a00 |
58113641425408 has 160 divisors (see below), whose sum is σ = 121969818432000. Its totient is φ = 27625005711360.
The previous prime is 58113641425351. The next prime is 58113641425417. The reversal of 58113641425408 is 80452414631185.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1506725548 + ... + 1506764116.
It is an arithmetic number, because the mean of its divisors is an integer number (762311365200).
Almost surely, 258113641425408 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 58113641425408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60984909216000).
58113641425408 is an abundant number, since it is smaller than the sum of its proper divisors (63856177006592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58113641425408 is a wasteful number, since it uses less digits than its factorization.
58113641425408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40286 (or 40270 counting only the distinct ones).
The product of its (nonzero) digits is 3686400, while the sum is 52.
The spelling of 58113641425408 in words is "fifty-eight trillion, one hundred thirteen billion, six hundred forty-one million, four hundred twenty-five thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •