Base | Representation |
---|---|
bin | 1110100010111… |
… | …1010011010000 |
3 | 11020210200120022 |
4 | 3220233103100 |
5 | 111104324102 |
6 | 10015403012 |
7 | 1340405036 |
oct | 350572320 |
9 | 136720508 |
10 | 61011152 |
11 | 31491644 |
12 | 18523468 |
13 | c842297 |
14 | 8162556 |
15 | 55525a2 |
hex | 3a2f4d0 |
61011152 has 40 divisors (see below), whose sum is σ = 122760000. Its totient is φ = 29352960.
The previous prime is 61011151. The next prime is 61011161. The reversal of 61011152 is 25111016.
61011152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 61011152.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61011151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48224 + ... + 49472.
It is an arithmetic number, because the mean of its divisors is an integer number (3069000).
Almost surely, 261011152 is an apocalyptic number.
It is an amenable number.
61011152 is an abundant number, since it is smaller than the sum of its proper divisors (61748848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61011152 is a wasteful number, since it uses less digits than its factorization.
61011152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1371 (or 1365 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 17.
The square root of 61011152 is about 7810.9635769219. The cubic root of 61011152 is about 393.6737058193.
Adding to 61011152 its reverse (25111016), we get a palindrome (86122168).
The spelling of 61011152 in words is "sixty-one million, eleven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •