Base | Representation |
---|---|
bin | 10001111101000100010… |
… | …11001010110000101100 |
3 | 2011222022220100221101101 |
4 | 20332202023022300230 |
5 | 40101403144104410 |
6 | 1151222300452444 |
7 | 62366246224630 |
oct | 10764213126054 |
9 | 2158286327341 |
10 | 616901159980 |
11 | 218698693206 |
12 | 9b686b4a124 |
13 | 462343250a1 |
14 | 21c02b94dc0 |
15 | 110a8a1dd3a |
hex | 8fa22cac2c |
616901159980 has 96 divisors (see below), whose sum is σ = 1488356739072. Its totient is φ = 210396614400.
The previous prime is 616901159969. The next prime is 616901159983. The reversal of 616901159980 is 89951109616.
It is not an unprimeable number, because it can be changed into a prime (616901159983) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 73166365 + ... + 73174795.
It is an arithmetic number, because the mean of its divisors is an integer number (15503716032).
Almost surely, 2616901159980 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 616901159980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (744178369536).
616901159980 is an abundant number, since it is smaller than the sum of its proper divisors (871455579092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
616901159980 is a wasteful number, since it uses less digits than its factorization.
616901159980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11135 (or 11133 counting only the distinct ones).
The product of its (nonzero) digits is 1049760, while the sum is 55.
It can be divided in two parts, 616901 and 159980, that added together give a triangular number (776881 = T1246).
The spelling of 616901159980 in words is "six hundred sixteen billion, nine hundred one million, one hundred fifty-nine thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •