Base | Representation |
---|---|
bin | 1101000011000100… |
… | …01101111011110001 |
3 | 200002012021101012112 |
4 | 12201202031323301 |
5 | 103321244202131 |
6 | 3115034535105 |
7 | 335410050545 |
oct | 64142157361 |
9 | 20065241175 |
10 | 7005069041 |
11 | 2a751a7063 |
12 | 1435b97495 |
13 | 87838c289 |
14 | 4a64b9a25 |
15 | 2aeebb02b |
hex | 1a188def1 |
7005069041 has 2 divisors, whose sum is σ = 7005069042. Its totient is φ = 7005069040.
The previous prime is 7005069031. The next prime is 7005069047. The reversal of 7005069041 is 1409605007.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6050506225 + 954562816 = 77785^2 + 30896^2 .
It is an emirp because it is prime and its reverse (1409605007) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-7005069041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 7005068989 and 7005069007.
It is not a weakly prime, because it can be changed into another prime (7005069047) 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, 3502534520 + 3502534521.
It is an arithmetic number, because the mean of its divisors is an integer number (3502534521).
Almost surely, 27005069041 is an apocalyptic number.
It is an amenable number.
7005069041 is a deficient number, since it is larger than the sum of its proper divisors (1).
7005069041 is an equidigital number, since it uses as much as digits as its factorization.
7005069041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The square root of 7005069041 is about 83696.2904853017. The cubic root of 7005069041 is about 1913.3928202444.
The spelling of 7005069041 in words is "seven billion, five million, sixty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •