Base | Representation |
---|---|
bin | 111000110100110010… |
… | …0110000010101100001 |
3 | 102122222111120220201211 |
4 | 1301221210300111201 |
5 | 3444404230432022 |
6 | 132020541230121 |
7 | 11550011444335 |
oct | 1615144602541 |
9 | 378874526654 |
10 | 122030327137 |
11 | 47830a35a34 |
12 | 1b797862341 |
13 | b679a1c584 |
14 | 5c98c577c5 |
15 | 3293358e77 |
hex | 1c69930561 |
122030327137 has 2 divisors, whose sum is σ = 122030327138. Its totient is φ = 122030327136.
The previous prime is 122030327123. The next prime is 122030327147. The reversal of 122030327137 is 731723030221.
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., 100491536016 + 21538791121 = 317004^2 + 146761^2 .
It is an emirp because it is prime and its reverse (731723030221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122030327137 - 27 = 122030327009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122030327099 and 122030327108.
It is not a weakly prime, because it can be changed into another prime (122030327147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61015163568 + 61015163569.
It is an arithmetic number, because the mean of its divisors is an integer number (61015163569).
Almost surely, 2122030327137 is an apocalyptic number.
It is an amenable number.
122030327137 is a deficient number, since it is larger than the sum of its proper divisors (1).
122030327137 is an equidigital number, since it uses as much as digits as its factorization.
122030327137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10584, while the sum is 31.
Adding to 122030327137 its reverse (731723030221), we get a palindrome (853753357358).
The spelling of 122030327137 in words is "one hundred twenty-two billion, thirty million, three hundred twenty-seven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •