Base | Representation |
---|---|
bin | 111000110110111101… |
… | …0010111101010010101 |
3 | 102200011120112021012212 |
4 | 1301231322113222111 |
5 | 4000031343231401 |
6 | 132032101123205 |
7 | 11551554146261 |
oct | 1615572275225 |
9 | 380146467185 |
10 | 122103102101 |
11 | 47869021932 |
12 | 1b7b80b9505 |
13 | b68bb20196 |
14 | 5ca479d0a1 |
15 | 3299931dbb |
hex | 1c6de97a95 |
122103102101 has 2 divisors, whose sum is σ = 122103102102. Its totient is φ = 122103102100.
The previous prime is 122103102049. The next prime is 122103102131. The reversal of 122103102101 is 101201301221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119543754001 + 2559348100 = 345751^2 + 50590^2 .
It is an emirp because it is prime and its reverse (101201301221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122103102101 is a prime.
It is a super-2 number, since 2×1221031021012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122103102131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61051551050 + 61051551051.
It is an arithmetic number, because the mean of its divisors is an integer number (61051551051).
Almost surely, 2122103102101 is an apocalyptic number.
It is an amenable number.
122103102101 is a deficient number, since it is larger than the sum of its proper divisors (1).
122103102101 is an equidigital number, since it uses as much as digits as its factorization.
122103102101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 122103102101 its reverse (101201301221), we get a palindrome (223304403322).
The spelling of 122103102101 in words is "one hundred twenty-two billion, one hundred three million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •