Base | Representation |
---|---|
bin | 1101110110110… |
… | …1110101001110 |
3 | 11001100212210000 |
4 | 3131231311032 |
5 | 104334342200 |
6 | 5433425130 |
7 | 1304011404 |
oct | 335556516 |
9 | 131325700 |
10 | 58121550 |
11 | 2a898643 |
12 | 1756b1a6 |
13 | c06cc66 |
14 | 7a0d474 |
15 | 5181300 |
hex | 376dd4e |
58121550 has 120 divisors (see below), whose sum is σ = 164203776. Its totient is φ = 15240960.
The previous prime is 58121537. The next prime is 58121579. The reversal of 58121550 is 5512185.
It is a super-2 number, since 2×581215502 = 6756229148805000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 457587 + ... + 457713.
Almost surely, 258121550 is an apocalyptic number.
58121550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 58121550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82101888).
58121550 is an abundant number, since it is smaller than the sum of its proper divisors (106082226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58121550 is a wasteful number, since it uses less digits than its factorization.
58121550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264 (or 250 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
The square root of 58121550 is about 7623.7490777176. The cubic root of 58121550 is about 387.3578805917.
The spelling of 58121550 in words is "fifty-eight million, one hundred twenty-one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •