Base | Representation |
---|---|
bin | 110001101111111… |
… | …1111010010100001 |
3 | 11022100010202101001 |
4 | 1203133333102201 |
5 | 11404322030311 |
6 | 433351312001 |
7 | 56240033356 |
oct | 14337772241 |
9 | 4270122331 |
10 | 1669330081 |
11 | 787325441 |
12 | 3a707b601 |
13 | 207acb6a3 |
14 | 11b9c062d |
15 | 9b8464c1 |
hex | 637ff4a1 |
1669330081 has 2 divisors, whose sum is σ = 1669330082. Its totient is φ = 1669330080.
The previous prime is 1669330031. The next prime is 1669330109. The reversal of 1669330081 is 1800339661.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1468115856 + 201214225 = 38316^2 + 14185^2 .
It is a cyclic number.
It is not a de Polignac number, because 1669330081 - 27 = 1669329953 is a prime.
It is a super-2 number, since 2×16693300812 = 5573325838662933122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1669330081.
It is not a weakly prime, because it can be changed into another prime (1669330001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 834665040 + 834665041.
It is an arithmetic number, because the mean of its divisors is an integer number (834665041).
Almost surely, 21669330081 is an apocalyptic number.
It is an amenable number.
1669330081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1669330081 is an equidigital number, since it uses as much as digits as its factorization.
1669330081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 37.
The square root of 1669330081 is about 40857.4360551418. The cubic root of 1669330081 is about 1186.2623307449.
The spelling of 1669330081 in words is "one billion, six hundred sixty-nine million, three hundred thirty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •