Base | Representation |
---|---|
bin | 111111100011101… |
… | …100010101011000 |
3 | 2202022110201202021 |
4 | 333203230111120 |
5 | 4140434234430 |
6 | 253450544224 |
7 | 35265403165 |
oct | 7743542530 |
9 | 2668421667 |
10 | 1066321240 |
11 | 4a7a01a26 |
12 | 259138074 |
13 | 13cbbb41a |
14 | a189306c |
15 | 6393207a |
hex | 3f8ec558 |
1066321240 has 16 divisors (see below), whose sum is σ = 2399222880. Its totient is φ = 426528480.
The previous prime is 1066321187. The next prime is 1066321259. The reversal of 1066321240 is 421236601.
It is a super-2 number, since 2×10663212402 = 2274081973750275200, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 13328976 + ... + 13329055.
It is an arithmetic number, because the mean of its divisors is an integer number (149951430).
Almost surely, 21066321240 is an apocalyptic number.
1066321240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1066321240 is an abundant number, since it is smaller than the sum of its proper divisors (1332901640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1066321240 is a wasteful number, since it uses less digits than its factorization.
1066321240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26658042 (or 26658038 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
The square root of 1066321240 is about 32654.5745646762. The cubic root of 1066321240 is about 1021.6356047365.
Adding to 1066321240 its reverse (421236601), we get a palindrome (1487557841).
The spelling of 1066321240 in words is "one billion, sixty-six million, three hundred twenty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •