Base | Representation |
---|---|
bin | 111111100100111… |
… | …101010111010100 |
3 | 2202100002121000212 |
4 | 333210331113110 |
5 | 4141030400030 |
6 | 253502024552 |
7 | 35301254630 |
oct | 7744752724 |
9 | 2670077025 |
10 | 1066653140 |
11 | 4a8109323 |
12 | 259278158 |
13 | 13cca6507 |
14 | a193bdc0 |
15 | 6399a595 |
hex | 3f93d5d4 |
1066653140 has 24 divisors (see below), whose sum is σ = 2559967872. Its totient is φ = 365709600.
The previous prime is 1066653139. The next prime is 1066653173. The reversal of 1066653140 is 413566601.
It is a super-2 number, since 2×10666531402 = 2275497842143719200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1066653097 and 1066653106.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3809336 + ... + 3809615.
It is an arithmetic number, because the mean of its divisors is an integer number (106665328).
Almost surely, 21066653140 is an apocalyptic number.
1066653140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1066653140 is an abundant number, since it is smaller than the sum of its proper divisors (1493314732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066653140 is a wasteful number, since it uses less digits than its factorization.
1066653140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7618967 (or 7618965 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 1066653140 is about 32659.6561525072. The cubic root of 1066653140 is about 1021.7415908347.
The spelling of 1066653140 in words is "one billion, sixty-six million, six hundred fifty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •