Base | Representation |
---|---|
bin | 11011101111011110110001… |
… | …010100111001000000101111 |
3 | 121000000001102102021222100121 |
4 | 123233132301110321000233 |
5 | 111443003201410133403 |
6 | 1111254400552105411 |
7 | 34461640202020654 |
oct | 3357366124710057 |
9 | 530001372258317 |
10 | 122010111021103 |
11 | 35970219968888 |
12 | 11826463395267 |
13 | 5310672680566 |
14 | 221b46c701c2b |
15 | e18b6a1213bd |
hex | 6ef7b153902f |
122010111021103 has 2 divisors, whose sum is σ = 122010111021104. Its totient is φ = 122010111021102.
The previous prime is 122010111021079. The next prime is 122010111021133. The reversal of 122010111021103 is 301120111010221.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (301120111010221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122010111021103 - 29 = 122010111020591 is a prime.
It is a super-2 number, since 2×1220101110211032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122010111021133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61005055510551 + 61005055510552.
It is an arithmetic number, because the mean of its divisors is an integer number (61005055510552).
Almost surely, 2122010111021103 is an apocalyptic number.
122010111021103 is a deficient number, since it is larger than the sum of its proper divisors (1).
122010111021103 is an equidigital number, since it uses as much as digits as its factorization.
122010111021103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 122010111021103 its reverse (301120111010221), we get a palindrome (423130222031324).
The spelling of 122010111021103 in words is "one hundred twenty-two trillion, ten billion, one hundred eleven million, twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •