Base | Representation |
---|---|
bin | 1011000110001… |
… | …10010101100000 |
3 | 20111011022110100 |
4 | 11203012111200 |
5 | 142312241242 |
6 | 13123102400 |
7 | 2210140611 |
oct | 543062540 |
9 | 214138410 |
10 | 93087072 |
11 | 485aa771 |
12 | 27211a00 |
13 | 16393110 |
14 | c511c08 |
15 | 828b54c |
hex | 58c6560 |
93087072 has 216 divisors, whose sum is σ = 304353504. Its totient is φ = 26813952.
The previous prime is 93087067. The next prime is 93087083. The reversal of 93087072 is 27078039.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1980553 + ... + 1980599.
It is an arithmetic number, because the mean of its divisors is an integer number (1409044).
Almost surely, 293087072 is an apocalyptic number.
93087072 is a gapful number since it is divisible by the number (92) 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 93087072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152176752).
93087072 is an abundant number, since it is smaller than the sum of its proper divisors (211266432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
93087072 is a wasteful number, since it uses less digits than its factorization.
93087072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122 (or 88 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 36.
The square root of 93087072 is about 9648.1641777076. The cubic root of 93087072 is about 453.2068409099.
The spelling of 93087072 in words is "ninety-three million, eighty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •