Base | Representation |
---|---|
bin | 1110100111100… |
… | …1110100000000 |
3 | 11021101012020000 |
4 | 3221321310000 |
5 | 111144110402 |
6 | 10030120000 |
7 | 1343115606 |
oct | 351716400 |
9 | 137335200 |
10 | 61316352 |
11 | 3167a979 |
12 | 18650000 |
13 | c91b186 |
14 | 8201876 |
15 | 55b2c1c |
hex | 3a79d00 |
61316352 has 90 divisors (see below), whose sum is σ = 182896098. Its totient is φ = 20431872.
The previous prime is 61316347. The next prime is 61316369. The reversal of 61316352 is 25361316.
61316352 is a `hidden beast` number, since 613 + 16 + 35 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 43877376 + 17438976 = 6624^2 + 4176^2 .
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 polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 19258 + ... + 22214.
Almost surely, 261316352 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 61316352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91448049).
61316352 is an abundant number, since it is smaller than the sum of its proper divisors (121579746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61316352 is an equidigital number, since it uses as much as digits as its factorization.
61316352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2985 (or 2962 counting only the distinct ones).
The product of its digits is 3240, while the sum is 27.
The square root of 61316352 is about 7830.4758476098. The cubic root of 61316352 is about 394.3290473573.
Adding to 61316352 its reverse (25361316), we get a palindrome (86677668).
The spelling of 61316352 in words is "sixty-one million, three hundred sixteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •