Base | Representation |
---|---|
bin | 111111100010101… |
… | …111110101010100 |
3 | 2202022000010211001 |
4 | 333202233311110 |
5 | 4140403322203 |
6 | 253441353044 |
7 | 35263321540 |
oct | 7742576524 |
9 | 2668003731 |
10 | 1066073428 |
11 | 4a7852822 |
12 | 259038784 |
13 | 13cb326a4 |
14 | a182aa20 |
15 | 638d391d |
hex | 3f8afd54 |
1066073428 has 12 divisors (see below), whose sum is σ = 2132146912. Its totient is φ = 456888600.
The previous prime is 1066073389. The next prime is 1066073467. The reversal of 1066073428 is 8243706601.
It is an interprime number because it is at equal distance from previous prime (1066073389) and next prime (1066073467).
1066073428 is an admirable number.
It is a super-2 number, since 2×10660734282 = 2273025107775342368, which contains 22 as substring.
It is a hoax number, since the sum of its digits (37) coincides with the sum of the digits of its distinct prime factors.
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 3 ways as a sum of consecutive naturals, for example, 19036998 + ... + 19037053.
Almost surely, 21066073428 is an apocalyptic number.
It is an amenable number.
1066073428 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066073428 is a wasteful number, since it uses less digits than its factorization.
1066073428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38074062 (or 38074060 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 37.
The square root of 1066073428 is about 32650.7798988018. The cubic root of 1066073428 is about 1021.5564562373.
The spelling of 1066073428 in words is "one billion, sixty-six million, seventy-three thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •