Base | Representation |
---|---|
bin | 1101001001101111… |
… | …10100100101100101 |
3 | 200020002122012220021 |
4 | 12210313310211211 |
5 | 103430113022122 |
6 | 3124355035141 |
7 | 336660024346 |
oct | 64467644545 |
9 | 20202565807 |
10 | 7061064037 |
11 | 2aa3871a15 |
12 | 145089bab1 |
13 | 886b66301 |
14 | 4adad40cd |
15 | 2b4d7c1c7 |
hex | 1a4df4965 |
7061064037 has 2 divisors, whose sum is σ = 7061064038. Its totient is φ = 7061064036.
The previous prime is 7061064001. The next prime is 7061064041. The reversal of 7061064037 is 7304601607.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5829475201 + 1231588836 = 76351^2 + 35094^2 .
It is an emirp because it is prime and its reverse (7304601607) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7061064037 - 27 = 7061063909 is a prime.
It is a super-2 number, since 2×70610640372 = 99717250669229474738, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 7061063993 and 7061064011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7061061037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3530532018 + 3530532019.
It is an arithmetic number, because the mean of its divisors is an integer number (3530532019).
Almost surely, 27061064037 is an apocalyptic number.
It is an amenable number.
7061064037 is a deficient number, since it is larger than the sum of its proper divisors (1).
7061064037 is an equidigital number, since it uses as much as digits as its factorization.
7061064037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21168, while the sum is 34.
The square root of 7061064037 is about 84030.1376709571. The cubic root of 7061064037 is about 1918.4775290548.
The spelling of 7061064037 in words is "seven billion, sixty-one million, sixty-four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •