Base | Representation |
---|---|
bin | 11100000001000000000000… |
… | …00110110010110100011000 |
3 | 22002010120110122020210100021 |
4 | 32000200000012302310120 |
5 | 31033332130221043330 |
6 | 335005512041120224 |
7 | 15655650130331563 |
oct | 1600400006626430 |
9 | 262116418223307 |
10 | 61607012674840 |
11 | 186a2429621a36 |
12 | 6aaba27a89074 |
13 | 284b6935c7669 |
14 | 112db1c51d4da |
15 | 71c816b5667a |
hex | 3808001b2d18 |
61607012674840 has 256 divisors, whose sum is σ = 146846475417600. Its totient is φ = 23234250547200.
The previous prime is 61607012674807. The next prime is 61607012674843. The reversal of 61607012674840 is 4847621070616.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61607012674843) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5398908735 + ... + 5398920145.
It is an arithmetic number, because the mean of its divisors is an integer number (573619044600).
Almost surely, 261607012674840 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61607012674840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73423237708800).
61607012674840 is an abundant number, since it is smaller than the sum of its proper divisors (85239462742760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61607012674840 is a wasteful number, since it uses less digits than its factorization.
61607012674840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12386 (or 12382 counting only the distinct ones).
The product of its (nonzero) digits is 2709504, while the sum is 52.
The spelling of 61607012674840 in words is "sixty-one trillion, six hundred seven billion, twelve million, six hundred seventy-four thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •