Base | Representation |
---|---|
bin | 100101000010100… |
… | …0111001101000000 |
3 | 10012121122112110100 |
4 | 1022011013031000 |
5 | 10021132313313 |
6 | 323154402400 |
7 | 42541041441 |
oct | 11205071500 |
9 | 3177575410 |
10 | 1242854208 |
11 | 588616842 |
12 | 2a8290400 |
13 | 16a64a1bb |
14 | bb0c72c8 |
15 | 741a3173 |
hex | 4a147340 |
1242854208 has 42 divisors (see below), whose sum is σ = 3562418834. Its totient is φ = 414284544.
The previous prime is 1242854203. The next prime is 1242854237. The reversal of 1242854208 is 8024582421.
It can be written as a sum of positive squares in only one way, i.e., 1140277824 + 102576384 = 33768^2 + 10128^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1242854203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1078291 + ... + 1079442.
Almost surely, 21242854208 is an apocalyptic number.
1242854208 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1242854208 is an abundant number, since it is smaller than the sum of its proper divisors (2319564626).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1242854208 is a wasteful number, since it uses less digits than its factorization.
1242854208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2157751 (or 2157738 counting only the distinct ones).
The product of its (nonzero) digits is 40960, while the sum is 36.
The square root of 1242854208 is about 35254.1374593111. The cubic root of 1242854208 is about 1075.1607354390.
The spelling of 1242854208 in words is "one billion, two hundred forty-two million, eight hundred fifty-four thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •