Base | Representation |
---|---|
bin | 111111100101101… |
… | …101111010011101 |
3 | 2202100110200210221 |
4 | 333211231322131 |
5 | 4141103230442 |
6 | 253510201341 |
7 | 35303043451 |
oct | 7745557235 |
9 | 2670420727 |
10 | 1066851997 |
11 | 4a8234772 |
12 | 259353251 |
13 | 140045b93 |
14 | a1990661 |
15 | 639d9467 |
hex | 3f96de9d |
1066851997 has 8 divisors (see below), whose sum is σ = 1094296280. Its totient is φ = 1039728960.
The previous prime is 1066851977. The next prime is 1066852001. The reversal of 1066851997 is 7991586601.
It can be written as a sum of positive squares in 4 ways, for example, as 17480761 + 1049371236 = 4181^2 + 32394^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1066851997 - 27 = 1066851869 is a prime.
It is a super-2 number, since 2×10668519972 = 2276346367005776018, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066851977) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73578 + ... + 86875.
It is an arithmetic number, because the mean of its divisors is an integer number (136787035).
Almost surely, 21066851997 is an apocalyptic number.
It is an amenable number.
1066851997 is a deficient number, since it is larger than the sum of its proper divisors (27444283).
1066851997 is a wasteful number, since it uses less digits than its factorization.
1066851997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160623.
The product of its (nonzero) digits is 816480, while the sum is 52.
The square root of 1066851997 is about 32662.7003935682. The cubic root of 1066851997 is about 1021.8050815906.
The spelling of 1066851997 in words is "one billion, sixty-six million, eight hundred fifty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •