Base | Representation |
---|---|
bin | 11011110000110100101001… |
… | …000000110010100110011111 |
3 | 121000022212102011012121211222 |
4 | 123300310221000302212133 |
5 | 112001011014203043403 |
6 | 1111405010043403555 |
7 | 34501413102514250 |
oct | 3360645100624637 |
9 | 530285364177758 |
10 | 122102313331103 |
11 | 359a6333746a86 |
12 | 118402b58235bb |
13 | 5319277832741 |
14 | 2221ad7cbcb27 |
15 | e1b2649c4338 |
hex | 6f0d2903299f |
122102313331103 has 16 divisors (see below), whose sum is σ = 142008019238400. Its totient is φ = 102816468136800.
The previous prime is 122102313331091. The next prime is 122102313331291. The reversal of 122102313331103 is 301133313201221.
It is a cyclic number.
It is not a de Polignac number, because 122102313331103 - 26 = 122102313331039 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122102313336103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 175950803 + ... + 176643396.
It is an arithmetic number, because the mean of its divisors is an integer number (8875501202400).
Almost surely, 2122102313331103 is an apocalyptic number.
122102313331103 is a deficient number, since it is larger than the sum of its proper divisors (19905705907297).
122102313331103 is an equidigital number, since it uses as much as digits as its factorization.
122102313331103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352595078.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 122102313331103 its reverse (301133313201221), we get a palindrome (423235626532324).
The spelling of 122102313331103 in words is "one hundred twenty-two trillion, one hundred two billion, three hundred thirteen million, three hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •