Base | Representation |
---|---|
bin | 11011111111010111111110… |
… | …00101110000100101110111 |
3 | 22001221020022020120100120110 |
4 | 31333223333011300211313 |
5 | 31031423234212122021 |
6 | 334524114003034103 |
7 | 15651632102346525 |
oct | 1577537705604567 |
9 | 261836266510513 |
10 | 61551161051511 |
11 | 1868077886174a |
12 | 6aa103b36b933 |
13 | 284633243cc31 |
14 | 112b1409a5315 |
15 | 71b1486d7476 |
hex | 37faff170977 |
61551161051511 has 16 divisors (see below), whose sum is σ = 82200693952224. Its totient is φ = 40967883393024.
The previous prime is 61551161051507. The next prime is 61551161051587. The reversal of 61551161051511 is 11515016115516.
It is not a de Polignac number, because 61551161051511 - 22 = 61551161051507 is a prime.
It is a super-2 number, since 2×615511610515112 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 61551161051511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61551161051311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13832545 + ... + 17732501.
It is an arithmetic number, because the mean of its divisors is an integer number (5137543372014).
Almost surely, 261551161051511 is an apocalyptic number.
61551161051511 is a deficient number, since it is larger than the sum of its proper divisors (20649532900713).
61551161051511 is a wasteful number, since it uses less digits than its factorization.
61551161051511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3908450.
The product of its (nonzero) digits is 22500, while the sum is 39.
The spelling of 61551161051511 in words is "sixty-one trillion, five hundred fifty-one billion, one hundred sixty-one million, fifty-one thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •