Base | Representation |
---|---|
bin | 1110000111000110011… |
… | …1000001100111001000 |
3 | 212011201221221120102101 |
4 | 3201301213001213020 |
5 | 12432441100133300 |
6 | 303211304243144 |
7 | 23341332622564 |
oct | 3416147014710 |
9 | 764657846371 |
10 | 242424224200 |
11 | 938a2177814 |
12 | 3ab974704b4 |
13 | 19b256bc412 |
14 | ba3a6166a4 |
15 | 648cbb9b6a |
hex | 38719c19c8 |
242424224200 has 24 divisors (see below), whose sum is σ = 563636321730. Its totient is φ = 96969689600.
The previous prime is 242424224197. The next prime is 242424224227. The reversal of 242424224200 is 2422424242.
It can be written as a sum of positive squares in 3 ways, for example, as 106854456996 + 135569767204 = 326886^2 + 368198^2 .
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 5 ways as a sum of consecutive naturals, for example, 606060361 + ... + 606060760.
Almost surely, 2242424224200 is an apocalyptic number.
242424224200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
242424224200 is an abundant number, since it is smaller than the sum of its proper divisors (321212097530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242424224200 is a wasteful number, since it uses less digits than its factorization.
242424224200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1212121137 (or 1212121128 counting only the distinct ones).
The product of its (nonzero) digits is 16384, while the sum is 28.
Adding to 242424224200 its reverse (2422424242), we get a palindrome (244846648442).
It can be divided in two parts, 2424242 and 24200, that added together give a palindrome (2448442).
The spelling of 242424224200 in words is "two hundred forty-two billion, four hundred twenty-four million, two hundred twenty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •