Base | Representation |
---|---|
bin | 111000110111111000… |
… | …0101111100100111101 |
3 | 102200020201220210200101 |
4 | 1301233300233210331 |
5 | 4000112314224203 |
6 | 132035130201101 |
7 | 11552412000442 |
oct | 1615760574475 |
9 | 380221823611 |
10 | 122134133053 |
11 | 47884596949 |
12 | 1b806583191 |
13 | b6953964aa |
14 | 5ca89599c9 |
15 | 329c51141d |
hex | 1c6fc2f93d |
122134133053 has 2 divisors, whose sum is σ = 122134133054. Its totient is φ = 122134133052.
The previous prime is 122134132999. The next prime is 122134133059. The reversal of 122134133053 is 350331431221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112126531609 + 10007601444 = 334853^2 + 100038^2 .
It is an emirp because it is prime and its reverse (350331431221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122134133053 - 233 = 113544198461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122134133059) 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 as a sum of consecutive naturals, namely, 61067066526 + 61067066527.
It is an arithmetic number, because the mean of its divisors is an integer number (61067066527).
Almost surely, 2122134133053 is an apocalyptic number.
It is an amenable number.
122134133053 is a deficient number, since it is larger than the sum of its proper divisors (1).
122134133053 is an equidigital number, since it uses as much as digits as its factorization.
122134133053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 122134133053 its reverse (350331431221), we get a palindrome (472465564274).
The spelling of 122134133053 in words is "one hundred twenty-two billion, one hundred thirty-four million, one hundred thirty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •