Base | Representation |
---|---|
bin | 11011010011110111000111… |
… | …101010010110010100111010 |
3 | 120202021121100110220021200121 |
4 | 123103313013222112110322 |
5 | 111220404100202400442 |
6 | 1103242424111323454 |
7 | 34204546030153435 |
oct | 3323670752262472 |
9 | 522247313807617 |
10 | 120112110200122 |
11 | 352a9294989967 |
12 | 1157a64682058a |
13 | 52036a5b763b1 |
14 | 21936585d681c |
15 | dd45d1b2c967 |
hex | 6d3dc7a9653a |
120112110200122 has 16 divisors (see below), whose sum is σ = 190767010825152. Its totient is φ = 56523133190080.
The previous prime is 120112110200077. The next prime is 120112110200167. The reversal of 120112110200122 is 221002011211021.
120112110200122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (120112110200077) and next prime (120112110200167).
It is a junction number, because it is equal to n+sod(n) for n = 120112110200096 and 120112110200105.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2705547 + ... + 15733537.
It is an arithmetic number, because the mean of its divisors is an integer number (11922938176572).
Almost surely, 2120112110200122 is an apocalyptic number.
120112110200122 is a deficient number, since it is larger than the sum of its proper divisors (70654900625030).
120112110200122 is a wasteful number, since it uses less digits than its factorization.
120112110200122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13299173.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 120112110200122 its reverse (221002011211021), we get a palindrome (341114121411143).
The spelling of 120112110200122 in words is "one hundred twenty trillion, one hundred twelve billion, one hundred ten million, two hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •