Base | Representation |
---|---|
bin | 1101000111010000… |
… | …00101010011111101 |
3 | 200011122022020100111 |
4 | 12203220011103331 |
5 | 103404240123041 |
6 | 3122331030021 |
7 | 336314244535 |
oct | 64350052375 |
9 | 20148266314 |
10 | 7040161021 |
11 | 2a92a951a3 |
12 | 144589b311 |
13 | 882727b6a |
14 | 4ab0124c5 |
15 | 2b30ed981 |
hex | 1a3a054fd |
7040161021 has 2 divisors, whose sum is σ = 7040161022. Its totient is φ = 7040161020.
The previous prime is 7040161003. The next prime is 7040161027. The reversal of 7040161021 is 1201610407.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5310765625 + 1729395396 = 72875^2 + 41586^2 .
It is a cyclic number.
It is not a de Polignac number, because 7040161021 - 211 = 7040158973 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 7040160983 and 7040161001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7040161027) 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, 3520080510 + 3520080511.
It is an arithmetic number, because the mean of its divisors is an integer number (3520080511).
Almost surely, 27040161021 is an apocalyptic number.
It is an amenable number.
7040161021 is a deficient number, since it is larger than the sum of its proper divisors (1).
7040161021 is an equidigital number, since it uses as much as digits as its factorization.
7040161021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
The square root of 7040161021 is about 83905.6673949978. The cubic root of 7040161021 is about 1916.5825548201.
Adding to 7040161021 its reverse (1201610407), we get a palindrome (8241771428).
The spelling of 7040161021 in words is "seven billion, forty million, one hundred sixty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •