Base | Representation |
---|---|
bin | 11011110110000100100111… |
… | …00010011101010001010000 |
3 | 22000210200021112120120220000 |
4 | 31323002103202131101100 |
5 | 31011204132414232222 |
6 | 334121213124050000 |
7 | 15616555241250510 |
oct | 1573022342352120 |
9 | 260720245516800 |
10 | 61231529055312 |
11 | 18568166938100 |
12 | 6a4b0b7233900 |
13 | 2822154254535 |
14 | 111989c3b3840 |
15 | 712b8c7509ac |
hex | 37b09389d450 |
61231529055312 has 1200 divisors, whose sum is σ = 226601758225920. Its totient is φ = 15621658652160.
The previous prime is 61231529055259. The next prime is 61231529055313. The reversal of 61231529055312 is 21355092513216.
61231529055312 is a `hidden beast` number, since 6 + 1 + 2 + 3 + 1 + 5 + 2 + 90 + 553 + 1 + 2 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61231529055313) by changing a digit.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 30816067983 + ... + 30816069969.
Almost surely, 261231529055312 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 61231529055312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (113300879112960).
61231529055312 is an abundant number, since it is smaller than the sum of its proper divisors (165370229170608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61231529055312 is a wasteful number, since it uses less digits than its factorization.
61231529055312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2522 (or 2496 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 45.
The spelling of 61231529055312 in words is "sixty-one trillion, two hundred thirty-one billion, five hundred twenty-nine million, fifty-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •