Base | Representation |
---|---|
bin | 110110000110110111… |
… | …100111101111011110 |
3 | 12112221220022202110020 |
4 | 312012313213233132 |
5 | 1422440402134434 |
6 | 42404534453010 |
7 | 4124463631440 |
oct | 660667475736 |
9 | 175856282406 |
10 | 58097302494 |
11 | 2270345a290 |
12 | b314804166 |
13 | 562b4c088a |
14 | 2b51cc6490 |
15 | 17a06b0849 |
hex | d86de7bde |
58097302494 has 128 divisors (see below), whose sum is σ = 156955594752. Its totient is φ = 13872176640.
The previous prime is 58097302489. The next prime is 58097302499. The reversal of 58097302494 is 49420379085.
It is an interprime number because it is at equal distance from previous prime (58097302489) and next prime (58097302499).
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58097302499) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 251709 + ... + 423735.
It is an arithmetic number, because the mean of its divisors is an integer number (1226215584).
Almost surely, 258097302494 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 58097302494, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (78477797376).
58097302494 is an abundant number, since it is smaller than the sum of its proper divisors (98858292258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58097302494 is a wasteful number, since it uses less digits than its factorization.
58097302494 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 172110.
The product of its (nonzero) digits is 2177280, while the sum is 51.
The spelling of 58097302494 in words is "fifty-eight billion, ninety-seven million, three hundred two thousand, four hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •