Base | Representation |
---|---|
bin | 11011101111110011011101… |
… | …00100100111100101010010 |
3 | 22000001002101010122101221011 |
4 | 31313321232210213211102 |
5 | 30444142044042000200 |
6 | 333434234232321134 |
7 | 15565162223606110 |
oct | 1567715644474522 |
9 | 260032333571834 |
10 | 61016160500050 |
11 | 18494898a06968 |
12 | 6a154108431aa |
13 | 2807a50c374a2 |
14 | 110d2ab170ab0 |
15 | 70c284e655ba |
hex | 377e6e927952 |
61016160500050 has 48 divisors (see below), whose sum is σ = 129765073610880. Its totient is φ = 20909802332160.
The previous prime is 61016160500023. The next prime is 61016160500051. The reversal of 61016160500050 is 5000506161016.
It is a junction number, because it is equal to n+sod(n) for n = 61016160499985 and 61016160500021.
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 23 ways as a sum of consecutive naturals, for example, 41035695 + ... + 42496594.
It is an arithmetic number, because the mean of its divisors is an integer number (2703439033560).
Almost surely, 261016160500050 is an apocalyptic number.
61016160500050 is an abundant number, since it is smaller than the sum of its proper divisors (68748913110830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61016160500050 is a wasteful number, since it uses less digits than its factorization.
61016160500050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83534395 (or 83534390 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 31.
Adding to 61016160500050 its reverse (5000506161016), we get a palindrome (66016666661066).
The spelling of 61016160500050 in words is "sixty-one trillion, sixteen billion, one hundred sixty million, five hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •