Base | Representation |
---|---|
bin | 111111100110000… |
… | …100001010011100 |
3 | 2202100122022211022 |
4 | 333212010022130 |
5 | 4141114140012 |
6 | 253512143312 |
7 | 35303603243 |
oct | 7746041234 |
9 | 2670568738 |
10 | 1066943132 |
11 | 4a8297192 |
12 | 259397b38 |
13 | 1400784c8 |
14 | a19b595a |
15 | 63a06472 |
hex | 3f98429c |
1066943132 has 12 divisors (see below), whose sum is σ = 1873118016. Its totient is φ = 531766560.
The previous prime is 1066943071. The next prime is 1066943149. The reversal of 1066943132 is 2313496601.
It is a happy number.
1066943132 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×10669431322 = 2276735293843938848, which contains 22 as substring.
It is a hoax number, since the sum of its digits (35) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1066943092 and 1066943101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 424844 + ... + 427347.
It is an arithmetic number, because the mean of its divisors is an integer number (156093168).
Almost surely, 21066943132 is an apocalyptic number.
It is an amenable number.
1066943132 is a deficient number, since it is larger than the sum of its proper divisors (806174884).
1066943132 is a wasteful number, since it uses less digits than its factorization.
1066943132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 852508 (or 852506 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 35.
The square root of 1066943132 is about 32664.0954566325. The cubic root of 1066943132 is about 1021.8341763963.
The spelling of 1066943132 in words is "one billion, sixty-six million, nine hundred forty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •