Base | Representation |
---|---|
bin | 11011110000111101110001… |
… | …100110100000010111010110 |
3 | 121000100210201200021111222010 |
4 | 123300331301212200113112 |
5 | 112001141111001041042 |
6 | 1111413311202245050 |
7 | 34502211124336566 |
oct | 3360756146402726 |
9 | 530323650244863 |
10 | 122112121112022 |
11 | 359aa506a02a48 |
12 | 11842192356786 |
13 | 531a17b75b3c2 |
14 | 22223886c6da6 |
15 | e1b63aa6359c |
hex | 6f0f719a05d6 |
122112121112022 has 96 divisors (see below), whose sum is σ = 278723453110272. Its totient is φ = 35521185639168.
The previous prime is 122112121112011. The next prime is 122112121112119. The reversal of 122112121112022 is 220211121211221.
It is a super-2 number, since 2×1221121211120222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 122112121112022.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 33548958 + ... + 37010225.
It is an arithmetic number, because the mean of its divisors is an integer number (2903369303232).
Almost surely, 2122112121112022 is an apocalyptic number.
122112121112022 is an abundant number, since it is smaller than the sum of its proper divisors (156611331998250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122112121112022 is a wasteful number, since it uses less digits than its factorization.
122112121112022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70559290 (or 70559271 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 122112121112022 its reverse (220211121211221), we get a palindrome (342323242323243).
The spelling of 122112121112022 in words is "one hundred twenty-two trillion, one hundred twelve billion, one hundred twenty-one million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •