Base | Representation |
---|---|
bin | 1110000110101000110… |
… | …1100011000011011000 |
3 | 212011102022101122210000 |
4 | 3201222031203003120 |
5 | 12432212311324140 |
6 | 303151112053000 |
7 | 23335264624026 |
oct | 3415215430330 |
9 | 764368348700 |
10 | 242300104920 |
11 | 938391020a5 |
12 | 3ab61994160 |
13 | 19b05a82563 |
14 | ba27d47716 |
15 | 6481d4da30 |
hex | 386a3630d8 |
242300104920 has 80 divisors (see below), whose sum is σ = 814397585760. Its totient is φ = 64613360448.
The previous prime is 242300104913. The next prime is 242300104931. The reversal of 242300104920 is 29401003242.
242300104920 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 19 ways as a sum of consecutive naturals, for example, 37388752 + ... + 37395231.
It is an arithmetic number, because the mean of its divisors is an integer number (10179969822).
Almost surely, 2242300104920 is an apocalyptic number.
242300104920 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
242300104920 is an abundant number, since it is smaller than the sum of its proper divisors (572097480840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242300104920 is a wasteful number, since it uses less digits than its factorization.
242300104920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74784006 (or 74783993 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The spelling of 242300104920 in words is "two hundred forty-two billion, three hundred million, one hundred four thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •