Base | Representation |
---|---|
bin | 11011111111111011010111… |
… | …00010110011100000000000 |
3 | 22002000001100100100000200000 |
4 | 31333331223202303200000 |
5 | 31032231142040132422 |
6 | 334540535150400000 |
7 | 15653203654646253 |
oct | 1577755342634000 |
9 | 262001310300600 |
10 | 61570160474112 |
11 | 186888385030a4 |
12 | 6aa4862200000 |
13 | 284806c737924 |
14 | 112c02402d09a |
15 | 71b8ab6aacac |
hex | 37ff6b8b3800 |
61570160474112 has 288 divisors, whose sum is σ = 195259868622000. Its totient is φ = 19316126121984.
The previous prime is 61570160474107. The next prime is 61570160474183. The reversal of 61570160474112 is 21147406107516.
61570160474112 is a `hidden beast` number, since 6 + 1 + 5 + 7 + 0 + 1 + 60 + 474 + 112 = 666.
It is a tau number, because it is divible by the number of its divisors (288).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4821514 + ... + 12099062.
Almost surely, 261570160474112 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 61570160474112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97629934311000).
61570160474112 is an abundant number, since it is smaller than the sum of its proper divisors (133689708147888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61570160474112 is an equidigital number, since it uses as much as digits as its factorization.
61570160474112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7277603 (or 7277571 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 45.
The spelling of 61570160474112 in words is "sixty-one trillion, five hundred seventy billion, one hundred sixty million, four hundred seventy-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •