Base | Representation |
---|---|
bin | 11011110000110100100100… |
… | …00101011111111111111011 |
3 | 22000011102121020200212111101 |
4 | 31320122102011133333323 |
5 | 31000230141202420132 |
6 | 333502255011312231 |
7 | 15600540366144415 |
oct | 1570322205377773 |
9 | 260142536625441 |
10 | 61051116060667 |
11 | 184a86a6464a37 |
12 | 6a201472ab677 |
13 | 280b131b9ba75 |
14 | 1110c657cd9b5 |
15 | 70d12db687e7 |
hex | 37869215fffb |
61051116060667 has 4 divisors (see below), whose sum is σ = 61057927529640. Its totient is φ = 61044304591696.
The previous prime is 61051116060629. The next prime is 61051116060679. The reversal of 61051116060667 is 76606061115016.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 61051116060667 - 211 = 61051116058619 is a prime.
It is a super-2 number, since 2×610511160606672 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61051116060617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3405721042 + ... + 3405738967.
It is an arithmetic number, because the mean of its divisors is an integer number (15264481882410).
Almost surely, 261051116060667 is an apocalyptic number.
61051116060667 is a deficient number, since it is larger than the sum of its proper divisors (6811468973).
61051116060667 is an equidigital number, since it uses as much as digits as its factorization.
61051116060667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6811468972.
The product of its (nonzero) digits is 272160, while the sum is 46.
The spelling of 61051116060667 in words is "sixty-one trillion, fifty-one billion, one hundred sixteen million, sixty thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.749 sec. • engine limits •