Base | Representation |
---|---|
bin | 111101100101110… |
… | …1101011000100001 |
3 | 12100000210120012202 |
4 | 1323023231120201 |
5 | 13213031321131 |
6 | 541023502545 |
7 | 102133244225 |
oct | 17313553041 |
9 | 5300716182 |
10 | 2066667041 |
11 | 97064159a |
12 | 498157a55 |
13 | 26c219b0a |
14 | 158690785 |
15 | c1680bcb |
hex | 7b2ed621 |
2066667041 has 2 divisors, whose sum is σ = 2066667042. Its totient is φ = 2066667040.
The previous prime is 2066666971. The next prime is 2066667089. The reversal of 2066667041 is 1407666602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1529122816 + 537544225 = 39104^2 + 23185^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2066667041 is a prime.
It is a super-2 number, since 2×20666670412 = 8542225316711391362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2066666986 and 2066667004.
It is not a weakly prime, because it can be changed into another prime (2066667091) 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, 1033333520 + 1033333521.
It is an arithmetic number, because the mean of its divisors is an integer number (1033333521).
Almost surely, 22066667041 is an apocalyptic number.
It is an amenable number.
2066667041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2066667041 is an equidigital number, since it uses as much as digits as its factorization.
2066667041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 38.
The square root of 2066667041 is about 45460.6097737371. The cubic root of 2066667041 is about 1273.7675217608.
The spelling of 2066667041 in words is "two billion, sixty-six million, six hundred sixty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.712 sec. • engine limits •