Base | Representation |
---|---|
bin | 11011101111011000011101… |
… | …001110000011010101100011 |
3 | 120222222101220220221001200002 |
4 | 123233120131032003111203 |
5 | 111442400310243424443 |
6 | 1111251320121450215 |
7 | 34461310165540154 |
oct | 3357303516032543 |
9 | 528871826831602 |
10 | 122003331233123 |
11 | 3596835a95181a |
12 | 1182509094096b |
13 | 530cb31b8a6b2 |
14 | 221adc810992b |
15 | e188bed052b8 |
hex | 6ef61d383563 |
122003331233123 has 2 divisors, whose sum is σ = 122003331233124. Its totient is φ = 122003331233122.
The previous prime is 122003331233117. The next prime is 122003331233213. The reversal of 122003331233123 is 321332133300221.
Together with next prime (122003331233213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 122003331233123 - 210 = 122003331232099 is a prime.
It is a super-2 number, since 2×1220033312331232 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (122003331233423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61001665616561 + 61001665616562.
It is an arithmetic number, because the mean of its divisors is an integer number (61001665616562).
Almost surely, 2122003331233123 is an apocalyptic number.
122003331233123 is a deficient number, since it is larger than the sum of its proper divisors (1).
122003331233123 is an equidigital number, since it uses as much as digits as its factorization.
122003331233123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 122003331233123 its reverse (321332133300221), we get a palindrome (443335464533344).
The spelling of 122003331233123 in words is "one hundred twenty-two trillion, three billion, three hundred thirty-one million, two hundred thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •