Base | Representation |
---|---|
bin | 111000111011110010… |
… | …001000101101010000 |
3 | 12211210102122211121000 |
4 | 320323302020231100 |
5 | 2000144412301002 |
6 | 44030042302000 |
7 | 4262631010533 |
oct | 707362105520 |
9 | 184712584530 |
10 | 61132540752 |
11 | 23a207a8758 |
12 | ba211b7900 |
13 | 59c329244a |
14 | 2d5d062a1a |
15 | 18cbdb561c |
hex | e3bc88b50 |
61132540752 has 40 divisors (see below), whose sum is σ = 175473034880. Its totient is φ = 20377513440.
The previous prime is 61132540751. The next prime is 61132540813. The reversal of 61132540752 is 25704523116.
61132540752 is a `hidden beast` number, since 6 + 11 + 32 + 540 + 75 + 2 = 666.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61132540751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 70754824 + ... + 70755687.
It is an arithmetic number, because the mean of its divisors is an integer number (4386825872).
Almost surely, 261132540752 is an apocalyptic number.
It is an amenable number.
61132540752 is an abundant number, since it is smaller than the sum of its proper divisors (114340494128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61132540752 is a wasteful number, since it uses less digits than its factorization.
61132540752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141510528 (or 141510516 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The spelling of 61132540752 in words is "sixty-one billion, one hundred thirty-two million, five hundred forty thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •