Base | Representation |
---|---|
bin | 110110000101001111… |
… | …001010110100100000 |
3 | 12112212222210122011220 |
4 | 312011033022310200 |
5 | 1422411344433211 |
6 | 42402115535040 |
7 | 4124012120250 |
oct | 660517126440 |
9 | 175788718156 |
10 | 58069921056 |
11 | 22699a581a4 |
12 | b3075ba480 |
13 | 5625924744 |
14 | 2b4c3d9960 |
15 | 179d0a2806 |
hex | d853cad20 |
58069921056 has 96 divisors (see below), whose sum is σ = 175035829248. Its totient is φ = 16512733440.
The previous prime is 58069921051. The next prime is 58069921067. The reversal of 58069921056 is 65012996085.
It is a tau number, because it is divible by the number of its divisors (96).
It is not an unprimeable number, because it can be changed into a prime (58069921051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 62980 + ... + 346563.
It is an arithmetic number, because the mean of its divisors is an integer number (1823289888).
Almost surely, 258069921056 is an apocalyptic number.
58069921056 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 58069921056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87517914624).
58069921056 is an abundant number, since it is smaller than the sum of its proper divisors (116965908192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58069921056 is a wasteful number, since it uses less digits than its factorization.
58069921056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 409774 (or 409766 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 51.
The spelling of 58069921056 in words is "fifty-eight billion, sixty-nine million, nine hundred twenty-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •