Base | Representation |
---|---|
bin | 10001110110011000010… |
… | …00000011110110011000 |
3 | 2011122001122000011211120 |
4 | 20323030020003312120 |
5 | 40022024331133031 |
6 | 1145430054125240 |
7 | 62211252110010 |
oct | 10731410036630 |
9 | 2148048004746 |
10 | 613310021016 |
11 | 217115577370 |
12 | 9aa44350820 |
13 | 45ab13282a4 |
14 | 21981c70c40 |
15 | 10e4860ca96 |
hex | 8ecc203d98 |
613310021016 has 64 divisors (see below), whose sum is σ = 1911615655680. Its totient is φ = 159301303680.
The previous prime is 613310020957. The next prime is 613310021021. The reversal of 613310021016 is 610120013316.
It is a super-2 number, since 2×6133100210162 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 165937011 + ... + 165940706.
It is an arithmetic number, because the mean of its divisors is an integer number (29868994620).
Almost surely, 2613310021016 is an apocalyptic number.
613310021016 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is an amenable number.
613310021016 is an abundant number, since it is smaller than the sum of its proper divisors (1298305634664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
613310021016 is a wasteful number, since it uses less digits than its factorization.
613310021016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331877744 (or 331877740 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
The spelling of 613310021016 in words is "six hundred thirteen billion, three hundred ten million, twenty-one thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •