Base | Representation |
---|---|
bin | 11011111000111000000101… |
… | …00100000110011100111110 |
3 | 22001010212222110211102122201 |
4 | 31330130002210012130332 |
5 | 31014244000021201010 |
6 | 334233350053302114 |
7 | 15626536030504114 |
oct | 1574340244063476 |
9 | 261125873742581 |
10 | 61327881037630 |
11 | 185a5010038559 |
12 | 6a6590733493a |
13 | 282b26b040b1c |
14 | 11203dcb45ab4 |
15 | 71542b59123a |
hex | 37c70290673e |
61327881037630 has 8 divisors (see below), whose sum is σ = 110390185867752. Its totient is φ = 24531152415048.
The previous prime is 61327881037547. The next prime is 61327881037667. The reversal of 61327881037630 is 3673018872316.
It is a happy number.
61327881037630 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×613278810376302 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 3066394051872 + ... + 3066394051891.
It is an arithmetic number, because the mean of its divisors is an integer number (13798773233469).
Almost surely, 261327881037630 is an apocalyptic number.
61327881037630 is a deficient number, since it is larger than the sum of its proper divisors (49062304830122).
61327881037630 is a wasteful number, since it uses less digits than its factorization.
61327881037630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6132788103770.
The product of its (nonzero) digits is 6096384, while the sum is 55.
The spelling of 61327881037630 in words is "sixty-one trillion, three hundred twenty-seven billion, eight hundred eighty-one million, thirty-seven thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •