Base | Representation |
---|---|
bin | 111000110110000011… |
… | …000100001111101010 |
3 | 12211112201121002112110 |
4 | 320312003010033222 |
5 | 2000000244100001 |
6 | 44012324023150 |
7 | 4260352060026 |
oct | 706603041752 |
9 | 184481532473 |
10 | 61036315626 |
11 | 23981455360 |
12 | b9b4b31ab6 |
13 | 59a9370bc0 |
14 | 2d50375386 |
15 | 18c37093d6 |
hex | e360c43ea |
61036315626 has 64 divisors (see below), whose sum is σ = 143677287936. Its totient is φ = 17041752000.
The previous prime is 61036315609. The next prime is 61036315693. The reversal of 61036315626 is 62651363016.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 404301 + ... + 534351.
It is an arithmetic number, because the mean of its divisors is an integer number (2244957624).
Almost surely, 261036315626 is an apocalyptic number.
61036315626 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 61036315626, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71838643968).
61036315626 is an abundant number, since it is smaller than the sum of its proper divisors (82640972310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61036315626 is a wasteful number, since it uses less digits than its factorization.
61036315626 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130627.
The product of its (nonzero) digits is 116640, while the sum is 39.
The spelling of 61036315626 in words is "sixty-one billion, thirty-six million, three hundred fifteen thousand, six hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •