Base | Representation |
---|---|
bin | 1011011001100100… |
… | …01110001001000000 |
3 | 120210111222212010212 |
4 | 11230302032021000 |
5 | 100013214243434 |
6 | 2451142213252 |
7 | 304442515523 |
oct | 55462161100 |
9 | 16714885125 |
10 | 6120071744 |
11 | 2660691536 |
12 | 1229724228 |
13 | 766c19537 |
14 | 420b46bba |
15 | 25c4548ce |
hex | 16cc8e240 |
6120071744 has 14 divisors (see below), whose sum is σ = 12144517494. Its totient is φ = 3060035840.
The previous prime is 6120071729. The next prime is 6120071747. The reversal of 6120071744 is 4471700216.
It can be written as a sum of positive squares in only one way, i.e., 4916814400 + 1203257344 = 70120^2 + 34688^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 6120071744.
It is not an unprimeable number, because it can be changed into a prime (6120071747) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 47812997 + ... + 47813124.
Almost surely, 26120071744 is an apocalyptic number.
6120071744 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
6120071744 is a deficient number, since it is larger than the sum of its proper divisors (6024445750).
6120071744 is an equidigital number, since it uses as much as digits as its factorization.
6120071744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95626133 (or 95626123 counting only the distinct ones).
The product of its (nonzero) digits is 9408, while the sum is 32.
The square root of 6120071744 is about 78230.8874038893. The cubic root of 6120071744 is about 1829.1620023780.
The spelling of 6120071744 in words is "six billion, one hundred twenty million, seventy-one thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •