Base | Representation |
---|---|
bin | 11011110001000101001101… |
… | …111010000110000111101110 |
3 | 121000101120100120220221220211 |
4 | 123301011031322012013232 |
5 | 112001303442210432342 |
6 | 1111421112143133034 |
7 | 34502613136440631 |
oct | 3361051572060756 |
9 | 530346316827824 |
10 | 122120112202222 |
11 | 35a02937745322 |
12 | 118438425a417a |
13 | 531ab531a1c44 |
14 | 2222905b11c18 |
15 | e1b95739dc17 |
hex | 6f114de861ee |
122120112202222 has 8 divisors (see below), whose sum is σ = 187440172217496. Its totient is φ = 59640054796392.
The previous prime is 122120112202201. The next prime is 122120112202259. The reversal of 122120112202222 is 222202211021221.
122120112202222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 122120112202193 and 122120112202202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 710000652253 + ... + 710000652424.
It is an arithmetic number, because the mean of its divisors is an integer number (23430021527187).
Almost surely, 2122120112202222 is an apocalyptic number.
122120112202222 is a deficient number, since it is larger than the sum of its proper divisors (65320060015274).
122120112202222 is a wasteful number, since it uses less digits than its factorization.
122120112202222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1420001304722.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 122120112202222 its reverse (222202211021221), we get a palindrome (344322323223443).
The spelling of 122120112202222 in words is "one hundred twenty-two trillion, one hundred twenty billion, one hundred twelve million, two hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •