Base | Representation |
---|---|
bin | 11011100001000110101001… |
… | …001001000011101100010000 |
3 | 120212111121021102000002102222 |
4 | 123201012221021003230100 |
5 | 111330311311043121222 |
6 | 1105220444412200212 |
7 | 34330363142216144 |
oct | 3341065111035420 |
9 | 525447242002388 |
10 | 121022131223312 |
11 | 3561a21a042800 |
12 | 116a6a96a69068 |
13 | 526b4517a0a07 |
14 | 21c5706855224 |
15 | ded0e3cbb542 |
hex | 6e11a9243b10 |
121022131223312 has 60 divisors (see below), whose sum is σ = 263728460558640. Its totient is φ = 53730755897280.
The previous prime is 121022131223309. The next prime is 121022131223327. The reversal of 121022131223312 is 213322131220121.
It is a super-2 number, since 2×1210221312233122 (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 (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 726793862 + ... + 726960357.
It is an arithmetic number, because the mean of its divisors is an integer number (4395474342644).
Almost surely, 2121022131223312 is an apocalyptic number.
It is an amenable number.
121022131223312 is an abundant number, since it is smaller than the sum of its proper divisors (142706329335328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121022131223312 is a wasteful number, since it uses less digits than its factorization.
121022131223312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1453754292 (or 1453754275 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 121022131223312 its reverse (213322131220121), we get a palindrome (334344262443433).
The spelling of 121022131223312 in words is "one hundred twenty-one trillion, twenty-two billion, one hundred thirty-one million, two hundred twenty-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •