Base | Representation |
---|---|
bin | 11011101111110011011101… |
… | …00100100111100101010101 |
3 | 22000001002101010122101221021 |
4 | 31313321232210213211111 |
5 | 30444142044042000203 |
6 | 333434234232321141 |
7 | 15565162223606113 |
oct | 1567715644474525 |
9 | 260032333571837 |
10 | 61016160500053 |
11 | 18494898a06970 |
12 | 6a154108431b1 |
13 | 2807a50c374a5 |
14 | 110d2ab170ab3 |
15 | 70c284e655bd |
hex | 377e6e927955 |
61016160500053 has 8 divisors (see below), whose sum is σ = 66706848948096. Its totient is φ = 55349432846400.
The previous prime is 61016160500051. The next prime is 61016160500093. The reversal of 61016160500053 is 35000506161016.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 61016160500053 - 21 = 61016160500051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 61016160499991 and 61016160500018.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61016160500051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5990193268 + ... + 5990203453.
It is an arithmetic number, because the mean of its divisors is an integer number (8338356118512).
Almost surely, 261016160500053 is an apocalyptic number.
It is an amenable number.
61016160500053 is a deficient number, since it is larger than the sum of its proper divisors (5690688448043).
61016160500053 is a wasteful number, since it uses less digits than its factorization.
61016160500053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11980397195.
The product of its (nonzero) digits is 16200, while the sum is 34.
Adding to 61016160500053 its reverse (35000506161016), we get a palindrome (96016666661069).
The spelling of 61016160500053 in words is "sixty-one trillion, sixteen billion, one hundred sixty million, five hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •