Base | Representation |
---|---|
bin | 11011111111000000011100… |
… | …01101100010001110110000 |
3 | 22001220000200221201122022020 |
4 | 31333200032031202032300 |
5 | 31031221402120034232 |
6 | 334514224344311440 |
7 | 15651004065025200 |
oct | 1577401615421660 |
9 | 261800627648266 |
10 | 61538529846192 |
11 | 18676386879193 |
12 | 6a9a6b5172580 |
13 | 284509b5a5049 |
14 | 112a6a31da400 |
15 | 71ab59832e2c |
hex | 37f80e3623b0 |
61538529846192 has 120 divisors (see below), whose sum is σ = 186107458043376. Its totient is φ = 17470446948864.
The previous prime is 61538529846083. The next prime is 61538529846197. The reversal of 61538529846192 is 29164892583516.
61538529846192 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×615385298461923 (a number of 42 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (61538529846197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 82956663 + ... + 83695190.
Almost surely, 261538529846192 is an apocalyptic number.
It is an amenable number.
61538529846192 is an abundant number, since it is smaller than the sum of its proper divisors (124568928197184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61538529846192 is a wasteful number, since it uses less digits than its factorization.
61538529846192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166652035 (or 166652022 counting only the distinct ones).
The product of its digits is 223948800, while the sum is 69.
The spelling of 61538529846192 in words is "sixty-one trillion, five hundred thirty-eight billion, five hundred twenty-nine million, eight hundred forty-six thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •