Base | Representation |
---|---|
bin | 111000110110110111… |
… | …0100010010101100111 |
3 | 102200011100200200002001 |
4 | 1301231232202111213 |
5 | 4000030100000403 |
6 | 132031510430131 |
7 | 11551515606454 |
oct | 1615556422547 |
9 | 380140620061 |
10 | 122100000103 |
11 | 478672a32a4 |
12 | 1b7b7062347 |
13 | b68b2a5293 |
14 | 5ca41d282b |
15 | 329951cc1d |
hex | 1c6dba2567 |
122100000103 has 4 divisors (see below), whose sum is σ = 125078048928. Its totient is φ = 119121951280.
The previous prime is 122100000097. The next prime is 122100000119. The reversal of 122100000103 is 301000001221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301000001221 = 7529 ⋅39978749.
It is a cyclic number.
It is not a de Polignac number, because 122100000103 - 225 = 122066445671 is a prime.
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 122100000103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122100000163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1489024351 + ... + 1489024432.
It is an arithmetic number, because the mean of its divisors is an integer number (31269512232).
Almost surely, 2122100000103 is an apocalyptic number.
122100000103 is a deficient number, since it is larger than the sum of its proper divisors (2978048825).
122100000103 is an equidigital number, since it uses as much as digits as its factorization.
122100000103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2978048824.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 122100000103 its reverse (301000001221), we get a palindrome (423100001324).
The spelling of 122100000103 in words is "one hundred twenty-two billion, one hundred million, one hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •