Base | Representation |
---|---|
bin | 110110000111010101… |
… | …100100011010000000 |
3 | 12112222110002121112100 |
4 | 312013111210122000 |
5 | 1422444404400102 |
6 | 42405415030400 |
7 | 4124620436604 |
oct | 660725443200 |
9 | 175873077470 |
10 | 58105153152 |
11 | 22707931632 |
12 | b31736b400 |
13 | 563000c037 |
14 | 2b52d6b504 |
15 | 17a1211a1c |
hex | d87564680 |
58105153152 has 96 divisors (see below), whose sum is σ = 168053036580. Its totient is φ = 19269992448.
The previous prime is 58105153129. The next prime is 58105153163. The reversal of 58105153152 is 25135150185.
58105153152 is a `hidden beast` number, since 58 + 10 + 515 + 31 + 52 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 58050156096 + 54997056 = 240936^2 + 7416^2 .
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 98928 + ... + 354960.
Almost surely, 258105153152 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 58105153152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84026518290).
58105153152 is an abundant number, since it is smaller than the sum of its proper divisors (109947883428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58105153152 is a wasteful number, since it uses less digits than its factorization.
58105153152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256250 (or 256235 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 36.
The spelling of 58105153152 in words is "fifty-eight billion, one hundred five million, one hundred fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •