Base | Representation |
---|---|
bin | 11011110011011110011110… |
… | …100000101010101100000000 |
3 | 121000222022010010120020111011 |
4 | 123303132132200222230000 |
5 | 112012003002322414000 |
6 | 1112024445305330304 |
7 | 34520530125315454 |
oct | 3363363640525400 |
9 | 530868103506434 |
10 | 122284673248000 |
11 | 35a667031036aa |
12 | 1186b709796994 |
13 | 533051a36a303 |
14 | 222a8772a2664 |
15 | e20d894872ba |
hex | 6f379e82ab00 |
122284673248000 has 72 divisors (see below), whose sum is σ = 304626406724640. Its totient is φ = 48913869286400.
The previous prime is 122284673247943. The next prime is 122284673248027. The reversal of 122284673248000 is 842376482221.
It is a super-2 number, since 2×1222846732480002 (a number of 29 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 1910666020 + ... + 1910730019.
It is an arithmetic number, because the mean of its divisors is an integer number (4230922315620).
Almost surely, 2122284673248000 is an apocalyptic number.
122284673248000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122284673248000 is an abundant number, since it is smaller than the sum of its proper divisors (182341733476640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122284673248000 is an frugal number, since it uses more digits than its factorization.
122284673248000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3821396070 (or 3821396046 counting only the distinct ones).
The product of its (nonzero) digits is 2064384, while the sum is 49.
The spelling of 122284673248000 in words is "one hundred twenty-two trillion, two hundred eighty-four billion, six hundred seventy-three million, two hundred forty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •