Base | Representation |
---|---|
bin | 111110101011110… |
… | …010011001010001 |
3 | 2201021220011112122 |
4 | 332223302121101 |
5 | 4123211303001 |
6 | 252204504025 |
7 | 35030004431 |
oct | 7653623121 |
9 | 2637804478 |
10 | 1051666001 |
11 | 49a702261 |
12 | 25424b015 |
13 | 139b59999 |
14 | 9d95a2c1 |
15 | 624d9b1b |
hex | 3eaf2651 |
1051666001 has 2 divisors, whose sum is σ = 1051666002. Its totient is φ = 1051666000.
The previous prime is 1051665997. The next prime is 1051666003. The reversal of 1051666001 is 1006661501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 898500625 + 153165376 = 29975^2 + 12376^2 .
It is a cyclic number.
It is not a de Polignac number, because 1051666001 - 22 = 1051665997 is a prime.
It is a super-2 number, since 2×10516660012 = 2212002755318664002, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 1051666003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1051666003) 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, 525833000 + 525833001.
It is an arithmetic number, because the mean of its divisors is an integer number (525833001).
Almost surely, 21051666001 is an apocalyptic number.
It is an amenable number.
1051666001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1051666001 is an equidigital number, since it uses as much as digits as its factorization.
1051666001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 1051666001 is about 32429.4002565573. The cubic root of 1051666001 is about 1016.9336338175.
The spelling of 1051666001 in words is "one billion, fifty-one million, six hundred sixty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •