Base | Representation |
---|---|
bin | 100101000001111… |
… | …1011111100011100 |
3 | 10012121001212121022 |
4 | 1022003323330130 |
5 | 10021042432243 |
6 | 323144023312 |
7 | 42535315640 |
oct | 11203737434 |
9 | 3177055538 |
10 | 1242545948 |
11 | 588426186 |
12 | 2a8161b38 |
13 | 16a56cab7 |
14 | bb046c20 |
15 | 74141b68 |
hex | 4a0fbf1c |
1242545948 has 24 divisors (see below), whose sum is σ = 2570786400. Its totient is φ = 514156608.
The previous prime is 1242545947. The next prime is 1242545971. The reversal of 1242545948 is 8495452421.
It is a Smith number, since the sum of its digits (44) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1242545899 and 1242545908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1242545947) 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 7 ways as a sum of consecutive naturals, for example, 764303 + ... + 765926.
It is an arithmetic number, because the mean of its divisors is an integer number (107116100).
Almost surely, 21242545948 is an apocalyptic number.
It is an amenable number.
1242545948 is an abundant number, since it is smaller than the sum of its proper divisors (1328240452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1242545948 is a wasteful number, since it uses less digits than its factorization.
1242545948 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1530269 (or 1530267 counting only the distinct ones).
The product of its digits is 460800, while the sum is 44.
The square root of 1242545948 is about 35249.7652190763. The cubic root of 1242545948 is about 1075.0718388624.
The spelling of 1242545948 in words is "one billion, two hundred forty-two million, five hundred forty-five thousand, nine hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •