Base | Representation |
---|---|
bin | 11011010100010011001001… |
… | …110111100111001001111000 |
3 | 120202101111001022202021120100 |
4 | 123110103021313213021320 |
5 | 111221402222233034144 |
6 | 1103304323101355400 |
7 | 34206663004232133 |
oct | 3324231167471170 |
9 | 522344038667510 |
10 | 120142212002424 |
11 | 35310031635527 |
12 | 11584447868b60 |
13 | 5206492363431 |
14 | 2194cb238121a |
15 | dd5294665269 |
hex | 6d44c9de7278 |
120142212002424 has 96 divisors (see below), whose sum is σ = 339558498957600. Its totient is φ = 38303261061120.
The previous prime is 120142212002399. The next prime is 120142212002437. The reversal of 120142212002424 is 424200212241021.
120142212002424 is a `hidden beast` number, since 1 + 2 + 0 + 14 + 2 + 21 + 200 + 2 + 424 = 666.
It is a super-2 number, since 2×1201422120024242 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18754464 + ... + 24331344.
It is an arithmetic number, because the mean of its divisors is an integer number (3537067697475).
Almost surely, 2120142212002424 is an apocalyptic number.
It is an amenable number.
120142212002424 is an abundant number, since it is smaller than the sum of its proper divisors (219416286955176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120142212002424 is a wasteful number, since it uses less digits than its factorization.
120142212002424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5589925 (or 5589918 counting only the distinct ones).
The product of its (nonzero) digits is 4096, while the sum is 27.
Adding to 120142212002424 its reverse (424200212241021), we get a palindrome (544342424243445).
The spelling of 120142212002424 in words is "one hundred twenty trillion, one hundred forty-two billion, two hundred twelve million, two thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •