Base | Representation |
---|---|
bin | 111001100101001100… |
… | …100000011111111001 |
3 | 12220120212000021021101 |
4 | 321211030200133321 |
5 | 2003110243213201 |
6 | 44223022011401 |
7 | 4316065355452 |
oct | 714514403771 |
9 | 186525007241 |
10 | 61827319801 |
11 | 24247a01515 |
12 | bb95a16b61 |
13 | 5aa41c4300 |
14 | 2dc743c129 |
15 | 191cda5d01 |
hex | e653207f9 |
61827319801 has 27 divisors (see below), whose sum is σ = 69290726733. Its totient is φ = 55140845760.
The previous prime is 61827319777. The next prime is 61827319859. The reversal of 61827319801 is 10891372816.
It is a happy number.
The square root of 61827319801 is 248651.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 44058429801 + 17768890000 = 209901^2 + 133300^2 .
It is a de Polignac number, because none of the positive numbers 2k-61827319801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61827319861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 100206045 + ... + 100206661.
Almost surely, 261827319801 is an apocalyptic number.
61827319801 is the 248651-st square number.
61827319801 is the 124326-th centered octagonal number.
It is an amenable number.
61827319801 is a deficient number, since it is larger than the sum of its proper divisors (7463406932).
61827319801 is an frugal number, since it uses more digits than its factorization.
61827319801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1322 (or 661 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 46.
The spelling of 61827319801 in words is "sixty-one billion, eight hundred twenty-seven million, three hundred nineteen thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •