Base | Representation |
---|---|
bin | 1110101001011… |
… | …0110111110100 |
3 | 11021121020111110 |
4 | 3222112313310 |
5 | 111211413010 |
6 | 10032435020 |
7 | 1344122616 |
oct | 352266764 |
9 | 137536443 |
10 | 61435380 |
11 | 31751346 |
12 | 186a8a70 |
13 | c9603c6 |
14 | 8232db6 |
15 | 55d8120 |
hex | 3a96df4 |
61435380 has 48 divisors (see below), whose sum is σ = 173706624. Its totient is φ = 16222080.
The previous prime is 61435373. The next prime is 61435421. The reversal of 61435380 is 8353416.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1210 + ... + 11150.
It is an arithmetic number, because the mean of its divisors is an integer number (3618888).
Almost surely, 261435380 is an apocalyptic number.
61435380 is a gapful number since it is divisible by the number (60) 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 61435380, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86853312).
61435380 is an abundant number, since it is smaller than the sum of its proper divisors (112271244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61435380 is a wasteful number, since it uses less digits than its factorization.
61435380 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10056 (or 10054 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 61435380 is about 7838.0724671312. The cubic root of 61435380 is about 394.5840411070.
Adding to 61435380 its reverse (8353416), we get a palindrome (69788796).
The spelling of 61435380 in words is "sixty-one million, four hundred thirty-five thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •