Base | Representation |
---|---|
bin | 11100000001000110100110… |
… | …000101111100001101010101 |
3 | 121011021211012112222020112201 |
4 | 130001012212011330031111 |
5 | 112122323304423031013 |
6 | 1114022554324044501 |
7 | 34645300544555134 |
oct | 3401064605741525 |
9 | 534254175866481 |
10 | 123221103330133 |
11 | 3629785a50a396 |
12 | 119a10aa233731 |
13 | 539a9143cc023 |
14 | 225dd0ca9791b |
15 | e3a3e4d7c3dd |
hex | 7011a617c355 |
123221103330133 has 2 divisors, whose sum is σ = 123221103330134. Its totient is φ = 123221103330132.
The previous prime is 123221103330107. The next prime is 123221103330137. The reversal of 123221103330133 is 331033301122321.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121963022553969 + 1258080776164 = 11043687^2 + 1121642^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123221103330133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123221103330137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61610551665066 + 61610551665067.
It is an arithmetic number, because the mean of its divisors is an integer number (61610551665067).
Almost surely, 2123221103330133 is an apocalyptic number.
It is an amenable number.
123221103330133 is a deficient number, since it is larger than the sum of its proper divisors (1).
123221103330133 is an equidigital number, since it uses as much as digits as its factorization.
123221103330133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 123221103330133 its reverse (331033301122321), we get a palindrome (454254404452454).
The spelling of 123221103330133 in words is "one hundred twenty-three trillion, two hundred twenty-one billion, one hundred three million, three hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •