Base | Representation |
---|---|
bin | 111000110100010001… |
… | …1100000100011011101 |
3 | 102122221022101221110012 |
4 | 1301220203200203131 |
5 | 3444340341120013 |
6 | 132015130453005 |
7 | 11546413166414 |
oct | 1615043404335 |
9 | 378838357405 |
10 | 122013223133 |
11 | 4782231349a |
12 | 1b791b94165 |
13 | b676311369 |
14 | 5c9688447b |
15 | 3291acb1a8 |
hex | 1c688e08dd |
122013223133 has 2 divisors, whose sum is σ = 122013223134. Its totient is φ = 122013223132.
The previous prime is 122013223117. The next prime is 122013223147. The reversal of 122013223133 is 331322310221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82919233849 + 39093989284 = 287957^2 + 197722^2 .
It is a cyclic number.
It is not a de Polignac number, because 122013223133 - 24 = 122013223117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122013223099 and 122013223108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122013223183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61006611566 + 61006611567.
It is an arithmetic number, because the mean of its divisors is an integer number (61006611567).
Almost surely, 2122013223133 is an apocalyptic number.
It is an amenable number.
122013223133 is a deficient number, since it is larger than the sum of its proper divisors (1).
122013223133 is an equidigital number, since it uses as much as digits as its factorization.
122013223133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 122013223133 its reverse (331322310221), we get a palindrome (453335533354).
The spelling of 122013223133 in words is "one hundred twenty-two billion, thirteen million, two hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •