Base | Representation |
---|---|
bin | 111111100010011… |
… | …111100001001001 |
3 | 2202021212202010222 |
4 | 333202133201021 |
5 | 4140344202401 |
6 | 253440115425 |
7 | 35262622652 |
oct | 7742374111 |
9 | 2667782128 |
10 | 1066006601 |
11 | 4a78075a0 |
12 | 259005b75 |
13 | 13cb0b14a |
14 | a1810529 |
15 | 638bdc1b |
hex | 3f89f849 |
1066006601 has 8 divisors (see below), whose sum is σ = 1191280608. Its totient is φ = 945460000.
The previous prime is 1066006589. The next prime is 1066006603.
1066006601 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1066006601 - 214 = 1065990217 is a prime.
It is a super-2 number, since 2×10660066012 = 2272740146751146402, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1066006603) 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 7 ways as a sum of consecutive naturals, for example, 1181375 + ... + 1182276.
It is an arithmetic number, because the mean of its divisors is an integer number (148910076).
Almost surely, 21066006601 is an apocalyptic number.
1066006601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1066006601 is a deficient number, since it is larger than the sum of its proper divisors (125274007).
1066006601 is a wasteful number, since it uses less digits than its factorization.
1066006601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2363703.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 1066006601 is about 32649.7565228288. The cubic root of 1066006601 is about 1021.5351103094.
The spelling of 1066006601 in words is "one billion, sixty-six million, six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •