Base | Representation |
---|---|
bin | 111111100101000… |
… | …000101001000000 |
3 | 2202100010021102220 |
4 | 333211000221000 |
5 | 4141031312220 |
6 | 253502211040 |
7 | 35301342021 |
oct | 7745005100 |
9 | 2670107386 |
10 | 1066666560 |
11 | 4a8118413 |
12 | 259283a80 |
13 | 13ccac65b |
14 | a1942c48 |
15 | 6399e540 |
hex | 3f940a40 |
1066666560 has 112 divisors (see below), whose sum is σ = 3401568000. Its totient is φ = 283193344.
The previous prime is 1066666553. The next prime is 1066666589. The reversal of 1066666560 is 656666601.
It is a super-2 number, since 2×10666665602 = 2275555100444467200, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 227116 + ... + 231764.
Almost surely, 21066666560 is an apocalyptic number.
1066666560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1066666560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1700784000).
1066666560 is an abundant number, since it is smaller than the sum of its proper divisors (2334901440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066666560 is a wasteful number, since it uses less digits than its factorization.
1066666560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4908 (or 4898 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 42.
The square root of 1066666560 is about 32659.8616041158. The cubic root of 1066666560 is about 1021.7458757999.
It can be divided in two parts, 106 and 6666560, that added together give a palindrome (6666666).
The spelling of 1066666560 in words is "one billion, sixty-six million, six hundred sixty-six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •