Base | Representation |
---|---|
bin | 111000110110101000… |
… | …0011001101000000111 |
3 | 102200010210211022022110 |
4 | 1301231100121220013 |
5 | 4000021034200403 |
6 | 132031025232103 |
7 | 11551361504421 |
oct | 1615520315007 |
9 | 380123738273 |
10 | 122092100103 |
11 | 47862897976 |
12 | 1b7b4492633 |
13 | b68976a51c |
14 | 5ca3137811 |
15 | 32989ac103 |
hex | 1c6d419a07 |
122092100103 has 16 divisors (see below), whose sum is σ = 162988017920. Its totient is φ = 81295510464.
The previous prime is 122092100101. The next prime is 122092100129. The reversal of 122092100103 is 301001290221.
It is not a de Polignac number, because 122092100103 - 21 = 122092100101 is a prime.
It is a super-2 number, since 2×1220921001032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122092100103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122092100101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19245150 + ... + 19251492.
It is an arithmetic number, because the mean of its divisors is an integer number (10186751120).
Almost surely, 2122092100103 is an apocalyptic number.
122092100103 is a deficient number, since it is larger than the sum of its proper divisors (40895917817).
122092100103 is a wasteful number, since it uses less digits than its factorization.
122092100103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13158.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 122092100103 its reverse (301001290221), we get a palindrome (423093390324).
The spelling of 122092100103 in words is "one hundred twenty-two billion, ninety-two million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •