Base | Representation |
---|---|
bin | 111111100010110… |
… | …001100111000011 |
3 | 2202022000111210122 |
4 | 333202301213003 |
5 | 4140404040312 |
6 | 253441450455 |
7 | 35263352006 |
oct | 7742614703 |
9 | 2668014718 |
10 | 1066080707 |
11 | 4a785823a |
12 | 259040a2b |
13 | 13cb35ab3 |
14 | a182d53d |
15 | 638d5b72 |
hex | 3f8b19c3 |
1066080707 has 4 divisors (see below), whose sum is σ = 1073862456. Its totient is φ = 1058298960.
The previous prime is 1066080703. The next prime is 1066080767. The reversal of 1066080707 is 7070806601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7070806601 = 367 ⋅19266503.
It is a cyclic number.
It is not a de Polignac number, because 1066080707 - 22 = 1066080703 is a prime.
It is a super-2 number, since 2×10660807072 = 2273056147675239698, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1066080703) 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 in 3 ways as a sum of consecutive naturals, for example, 3890669 + ... + 3890942.
It is an arithmetic number, because the mean of its divisors is an integer number (268465614).
Almost surely, 21066080707 is an apocalyptic number.
1066080707 is a deficient number, since it is larger than the sum of its proper divisors (7781749).
1066080707 is an equidigital number, since it uses as much as digits as its factorization.
1066080707 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7781748.
The product of its (nonzero) digits is 14112, while the sum is 35.
The square root of 1066080707 is about 32650.8913660868. The cubic root of 1066080707 is about 1021.5587812468.
The spelling of 1066080707 in words is "one billion, sixty-six million, eighty thousand, seven hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •