Base | Representation |
---|---|
bin | 10010000100101101001… |
… | …001100001100011110100 |
3 | 11101201211022210121101121 |
4 | 102010231021201203310 |
5 | 130322110233120040 |
6 | 2350322431033324 |
7 | 155505664324240 |
oct | 22045511414364 |
9 | 4351738717347 |
10 | 1242003020020 |
11 | 439804364784 |
12 | 18086036b844 |
13 | 901746310c9 |
14 | 44182b39420 |
15 | 2249247ec4a |
hex | 1212d2618f4 |
1242003020020 has 48 divisors (see below), whose sum is σ = 3008665296000. Its totient is φ = 421849885824.
The previous prime is 1242003019997. The next prime is 1242003020039. The reversal of 1242003020020 is 200203002421.
It is a junction number, because it is equal to n+sod(n) for n = 1242003019976 and 1242003020003.
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 15 ways as a sum of consecutive naturals, for example, 41440395 + ... + 41470354.
It is an arithmetic number, because the mean of its divisors is an integer number (62680527000).
Almost surely, 21242003020020 is an apocalyptic number.
1242003020020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1242003020020 is an abundant number, since it is smaller than the sum of its proper divisors (1766662275980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1242003020020 is a wasteful number, since it uses less digits than its factorization.
1242003020020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82910872 (or 82910870 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 16.
Adding to 1242003020020 its reverse (200203002421), we get a palindrome (1442206022441).
The spelling of 1242003020020 in words is "one trillion, two hundred forty-two billion, three million, twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •