Base | Representation |
---|---|
bin | 1101000100011001… |
… | …10000010110010001 |
3 | 200002222020220111211 |
4 | 12202030300112101 |
5 | 103332123020144 |
6 | 3120113540121 |
7 | 335603613016 |
oct | 64214602621 |
9 | 20088226454 |
10 | 7016220049 |
11 | 2a80522a73 |
12 | 1439874641 |
13 | 87a7949c7 |
14 | 4a7b7d70d |
15 | 2b0e70034 |
hex | 1a2330591 |
7016220049 has 8 divisors (see below), whose sum is σ = 7258207232. Its totient is φ = 6775211520.
The previous prime is 7016220031. The next prime is 7016220077. The reversal of 7016220049 is 9400226107.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 7016220049 - 27 = 7016219921 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 7016220049.
It is not an unprimeable number, because it can be changed into a prime (7016220089) 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 in 7 ways as a sum of consecutive naturals, for example, 230064 + ... + 258769.
It is an arithmetic number, because the mean of its divisors is an integer number (907275904).
Almost surely, 27016220049 is an apocalyptic number.
It is an amenable number.
7016220049 is a deficient number, since it is larger than the sum of its proper divisors (241987183).
7016220049 is a wasteful number, since it uses less digits than its factorization.
7016220049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489327.
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 7016220049 is about 83762.8798991534. The cubic root of 7016220049 is about 1914.4075591028.
The spelling of 7016220049 in words is "seven billion, sixteen million, two hundred twenty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •