Base | Representation |
---|---|
bin | 111111100101101… |
… | …001010101001001 |
3 | 2202100102202001200 |
4 | 333211221111021 |
5 | 4141102130400 |
6 | 253505534413 |
7 | 35302634643 |
oct | 7745512511 |
9 | 2670382050 |
10 | 1066833225 |
11 | 4a8221657 |
12 | 259344409 |
13 | 14003a483 |
14 | a1987893 |
15 | 639d3b00 |
hex | 3f969549 |
1066833225 has 72 divisors (see below), whose sum is σ = 2018894592. Its totient is φ = 537667200.
The previous prime is 1066833211. The next prime is 1066833227. The reversal of 1066833225 is 5223386601.
It is a happy number.
It is not a de Polignac number, because 1066833225 - 210 = 1066832201 is a prime.
It is a super-2 number, since 2×10668332252 = 2276266259927801250, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1066833225.
It is not an unprimeable number, because it can be changed into a prime (1066833227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 298147 + ... + 301703.
Almost surely, 21066833225 is an apocalyptic number.
1066833225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1066833225 is a deficient number, since it is larger than the sum of its proper divisors (952061367).
1066833225 is a wasteful number, since it uses less digits than its factorization.
1066833225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3647 (or 3639 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The square root of 1066833225 is about 32662.4130308831. The cubic root of 1066833225 is about 1021.7990884327.
The spelling of 1066833225 in words is "one billion, sixty-six million, eight hundred thirty-three thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.535 sec. • engine limits •