Base | Representation |
---|---|
bin | 111111100101010… |
… | …010100110000100 |
3 | 2202100021000022121 |
4 | 333211102212010 |
5 | 4141041140400 |
6 | 253503535324 |
7 | 35302066306 |
oct | 7745224604 |
9 | 2670230277 |
10 | 1066740100 |
11 | 4a8168698 |
12 | 2592ba544 |
13 | 140006c7a |
14 | a1961976 |
15 | 639b621a |
hex | 3f952984 |
1066740100 has 36 divisors (see below), whose sum is σ = 2337322624. Its totient is φ = 422549280.
The previous prime is 1066740079. The next prime is 1066740109. The reversal of 1066740100 is 10476601.
It is a happy number.
1066740100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10667401002 = 2275868881896020000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (1066740109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 41484 + ... + 62083.
Almost surely, 21066740100 is an apocalyptic number.
1066740100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1066740100 is an abundant number, since it is smaller than the sum of its proper divisors (1270582524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066740100 is a wasteful number, since it uses less digits than its factorization.
1066740100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103684 (or 103677 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 25.
The square root of 1066740100 is about 32660.9874314908. The cubic root of 1066740100 is about 1021.7693562600.
The spelling of 1066740100 in words is "one billion, sixty-six million, seven hundred forty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •