Base | Representation |
---|---|
bin | 11011110110110001010111… |
… | …01010100101110000110001 |
3 | 22000212222022000211000000000 |
4 | 31323120223222211300301 |
5 | 31012102334334114221 |
6 | 334140225232220213 |
7 | 15621365533262160 |
oct | 1573305352456061 |
9 | 260788260730000 |
10 | 61255556160561 |
11 | 18577376583984 |
12 | 6a538a199a669 |
13 | 28244b3051089 |
14 | 111aadb4673d7 |
15 | 7135e6ce7e26 |
hex | 37b62baa5c31 |
61255556160561 has 40 divisors (see below), whose sum is σ = 105007746737344. Its totient is φ = 35003174870160.
The previous prime is 61255556160509. The next prime is 61255556160611. The reversal of 61255556160561 is 16506165555216.
61255556160561 is a `hidden beast` number, since 6 + 1 + 25 + 5 + 5 + 5 + 6 + 1 + 605 + 6 + 1 = 666.
It is not a de Polignac number, because 61255556160561 - 29 = 61255556160049 is a prime.
It is a super-2 number, since 2×612555561605612 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 61255556160498 and 61255556160507.
It is not an unprimeable number, because it can be changed into a prime (61255556160661) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 222155410 + ... + 222430971.
Almost surely, 261255556160561 is an apocalyptic number.
It is an amenable number.
61255556160561 is a deficient number, since it is larger than the sum of its proper divisors (43752190576783).
61255556160561 is an frugal number, since it uses more digits than its factorization.
61255556160561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444586415 (or 444586391 counting only the distinct ones).
The product of its (nonzero) digits is 8100000, while the sum is 54.
The spelling of 61255556160561 in words is "sixty-one trillion, two hundred fifty-five billion, five hundred fifty-six million, one hundred sixty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •