Base | Representation |
---|---|
bin | 10001111011110110010… |
… | …00001011110100100000 |
3 | 2011220122020200202000120 |
4 | 20331323020023310200 |
5 | 40044032443111324 |
6 | 1151033255520240 |
7 | 62344103065200 |
oct | 10757310136440 |
9 | 2156566622016 |
10 | 616246066464 |
11 | 218391925806 |
12 | 9b523689080 |
13 | 4615b6a98a2 |
14 | 21b7db8a400 |
15 | 1106b26c179 |
hex | 8f7b20bd20 |
616246066464 has 144 divisors (see below), whose sum is σ = 1896570160128. Its totient is φ = 174683755008.
The previous prime is 616246066463. The next prime is 616246066477. The reversal of 616246066464 is 464660642616.
It is not an unprimeable number, because it can be changed into a prime (616246066463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 81642 + ... + 1113174.
It is an arithmetic number, because the mean of its divisors is an integer number (13170626112).
Almost surely, 2616246066464 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 616246066464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (948285080064).
616246066464 is an abundant number, since it is smaller than the sum of its proper divisors (1280324093664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
616246066464 is a wasteful number, since it uses less digits than its factorization.
616246066464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1031687 (or 1031672 counting only the distinct ones).
The product of its (nonzero) digits is 5971968, while the sum is 51.
The spelling of 616246066464 in words is "six hundred sixteen billion, two hundred forty-six million, sixty-six thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •