Base | Representation |
---|---|
bin | 111001010100000001… |
… | …001000001101000000 |
3 | 12212211202201102000000 |
4 | 321110001020031000 |
5 | 2002013003432112 |
6 | 44134245000000 |
7 | 4305665631531 |
oct | 712401101500 |
9 | 185752642000 |
10 | 61539124032 |
11 | 2410a25a7a1 |
12 | bb153b3000 |
13 | 5a5959a379 |
14 | 2d9b05c688 |
15 | 19029297dc |
hex | e54048340 |
61539124032 has 98 divisors (see below), whose sum is σ = 183091431378. Its totient is φ = 20513025792.
The previous prime is 61539124013. The next prime is 61539124033. The reversal of 61539124032 is 23042193516.
61539124032 is a `hidden beast` number, since 615 + 3 + 9 + 1 + 2 + 4 + 0 + 32 = 666.
It can be written as a sum of positive squares in only one way, i.e., 49593508416 + 11945615616 = 222696^2 + 109296^2 .
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 (61539124033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 612843 + ... + 706154.
Almost surely, 261539124032 is an apocalyptic number.
It is an amenable number.
61539124032 is an abundant number, since it is smaller than the sum of its proper divisors (121552307346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61539124032 is an equidigital number, since it uses as much as digits as its factorization.
61539124032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1319027 (or 1319002 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
The spelling of 61539124032 in words is "sixty-one billion, five hundred thirty-nine million, one hundred twenty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •