Base | Representation |
---|---|
bin | 111111100101000… |
… | …000101001101001 |
3 | 2202100010021111102 |
4 | 333211000221221 |
5 | 4141031312401 |
6 | 253502211145 |
7 | 35301342110 |
oct | 7745005151 |
9 | 2670107442 |
10 | 1066666601 |
11 | 4a8118450 |
12 | 259283ab5 |
13 | 13ccac690 |
14 | a1942c77 |
15 | 6399e56b |
hex | 3f940a69 |
1066666601 has 16 divisors (see below), whose sum is σ = 1432169088. Its totient is φ = 767232000.
The previous prime is 1066666589. The next prime is 1066666609.
1066666601 is nontrivially palindromic in base 10.
1066666601 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1066666601 - 218 = 1066404457 is a prime.
It is a super-2 number, since 2×10666666012 = 2275555275377786402, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1066666609) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 531800 + ... + 533801.
It is an arithmetic number, because the mean of its divisors is an integer number (89510568).
Almost surely, 21066666601 is an apocalyptic number.
1066666601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1066666601 is a deficient number, since it is larger than the sum of its proper divisors (365502487).
1066666601 is a wasteful number, since it uses less digits than its factorization.
1066666601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065632.
The product of its (nonzero) digits is 46656, while the sum is 38.
The square root of 1066666601 is about 32659.8622317976. The cubic root of 1066666601 is about 1021.7458888910.
The spelling of 1066666601 in words is "one billion, sixty-six million, six hundred sixty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •