Base | Representation |
---|---|
bin | 1110100111110… |
… | …0110011010000 |
3 | 11021101211000100 |
4 | 3221330303100 |
5 | 111200003332 |
6 | 10030252400 |
7 | 1343166363 |
oct | 351746320 |
9 | 137354010 |
10 | 61328592 |
11 | 31689096 |
12 | 18657100 |
13 | c923910 |
14 | 82060da |
15 | 55b667c |
hex | 3a7ccd0 |
61328592 has 90 divisors (see below), whose sum is σ = 185864406. Its totient is φ = 18766080.
The previous prime is 61328563. The next prime is 61328609. The reversal of 61328592 is 29582316.
61328592 is a `hidden beast` number, since 61 + 3 + 2 + 8 + 592 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 13220496 + 48108096 = 3636^2 + 6936^2 .
It is a super-2 number, since 2×613285922 = 7522392393404928, which contains 22 as substring.
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 polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 338742 + ... + 338922.
Almost surely, 261328592 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 61328592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92932203).
61328592 is an abundant number, since it is smaller than the sum of its proper divisors (124535814).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61328592 is a wasteful number, since it uses less digits than its factorization.
61328592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 389 (or 199 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
The square root of 61328592 is about 7831.2573703078. The cubic root of 61328592 is about 394.3552843303.
The spelling of 61328592 in words is "sixty-one million, three hundred twenty-eight thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •