Base | Representation |
---|---|
bin | 11011110101011101101110… |
… | …001010010010110100000000 |
3 | 121001110100202221211200222201 |
4 | 123311131232022102310000 |
5 | 112021222311030431034 |
6 | 1112211322545042544 |
7 | 34533434651311024 |
oct | 3365355612226400 |
9 | 531410687750881 |
10 | 122421301030144 |
11 | 36009644a07636 |
12 | 1189209a026454 |
13 | 53403823b2b0c |
14 | 2233318ab6384 |
15 | e246d40dd014 |
hex | 6f576e292d00 |
122421301030144 has 36 divisors (see below), whose sum is σ = 246883614458404. Its totient is φ = 60579612868608.
The previous prime is 122421301030109. The next prime is 122421301030181. The reversal of 122421301030144 is 441030103124221.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 96181171840000 + 26240129190144 = 9807200^2 + 5122512^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2464965927 + ... + 2465015590.
Almost surely, 2122421301030144 is an apocalyptic number.
It is an amenable number.
122421301030144 is an abundant number, since it is smaller than the sum of its proper divisors (124462313428260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122421301030144 is an frugal number, since it uses more digits than its factorization.
122421301030144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4929981630 (or 4929981616 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 122421301030144 its reverse (441030103124221), we get a palindrome (563451404154365).
The spelling of 122421301030144 in words is "one hundred twenty-two trillion, four hundred twenty-one billion, three hundred one million, thirty thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •