Base | Representation |
---|---|
bin | 111111100101101… |
… | …000000101000000 |
3 | 2202100102111000201 |
4 | 333211220011000 |
5 | 4141101444341 |
6 | 253505454544 |
7 | 35302613665 |
oct | 7745500500 |
9 | 2670374021 |
10 | 1066828096 |
11 | 4a8218814 |
12 | 259341454 |
13 | 140038039 |
14 | a1985a6c |
15 | 639d2331 |
hex | 3f968140 |
1066828096 has 28 divisors (see below), whose sum is σ = 2156937012. Its totient is φ = 523347968.
The previous prime is 1066828003. The next prime is 1066828097. The reversal of 1066828096 is 6908286601.
It can be written as a sum of positive squares in 2 ways, for example, as 585640000 + 481188096 = 24200^2 + 21936^2 .
It is a super-2 number, since 2×10668280962 = 2276244372829970432, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1066828097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 153865 + ... + 160648.
Almost surely, 21066828096 is an apocalyptic number.
1066828096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1066828096 is an abundant number, since it is smaller than the sum of its proper divisors (1090108916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066828096 is an equidigital number, since it uses as much as digits as its factorization.
1066828096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314578 (or 314568 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 46.
The square root of 1066828096 is about 32662.3345154629. The cubic root of 1066828096 is about 1021.7974509334.
The spelling of 1066828096 in words is "one billion, sixty-six million, eight hundred twenty-eight thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •