Base | Representation |
---|---|
bin | 1101001100011111… |
… | …00010000111110001 |
3 | 200021200220101102012 |
4 | 12212033202013301 |
5 | 104002004311243 |
6 | 3130535532305 |
7 | 340356330422 |
oct | 64617420761 |
9 | 20250811365 |
10 | 7084057073 |
11 | 3005846a25 |
12 | 145852a095 |
13 | 88b856b62 |
14 | 4b2b9b649 |
15 | 2b6dbed18 |
hex | 1a63e21f1 |
7084057073 has 2 divisors, whose sum is σ = 7084057074. Its totient is φ = 7084057072.
The previous prime is 7084057027. The next prime is 7084057081. The reversal of 7084057073 is 3707504807.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4368813409 + 2715243664 = 66097^2 + 52108^2 .
It is a cyclic number.
It is not a de Polignac number, because 7084057073 - 212 = 7084052977 is a prime.
It is a super-2 number, since 2×70840570732 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 7084057073.
It is not a weakly prime, because it can be changed into another prime (7084057373) by changing a digit.
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 as a sum of consecutive naturals, namely, 3542028536 + 3542028537.
It is an arithmetic number, because the mean of its divisors is an integer number (3542028537).
Almost surely, 27084057073 is an apocalyptic number.
It is an amenable number.
7084057073 is a deficient number, since it is larger than the sum of its proper divisors (1).
7084057073 is an equidigital number, since it uses as much as digits as its factorization.
7084057073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 164640, while the sum is 41.
The square root of 7084057073 is about 84166.8406975098. The cubic root of 7084057073 is about 1920.5576607304.
The spelling of 7084057073 in words is "seven billion, eighty-four million, fifty-seven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •