Base | Representation |
---|---|
bin | 111000110100110001… |
… | …1111100001011000101 |
3 | 102122222111012001122111 |
4 | 1301221203330023011 |
5 | 3444404202112402 |
6 | 132020532501021 |
7 | 11550006564406 |
oct | 1615143741305 |
9 | 378874161574 |
10 | 122030113477 |
11 | 478308aa458 |
12 | 1b79777a771 |
13 | b67997624c |
14 | 5c98bdd9ad |
15 | 32933159d7 |
hex | 1c698fc2c5 |
122030113477 has 2 divisors, whose sum is σ = 122030113478. Its totient is φ = 122030113476.
The previous prime is 122030113427. The next prime is 122030113529. The reversal of 122030113477 is 774311030221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80557198276 + 41472915201 = 283826^2 + 203649^2 .
It is an emirp because it is prime and its reverse (774311030221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122030113477 - 231 = 119882629829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122030113417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61015056738 + 61015056739.
It is an arithmetic number, because the mean of its divisors is an integer number (61015056739).
Almost surely, 2122030113477 is an apocalyptic number.
It is an amenable number.
122030113477 is a deficient number, since it is larger than the sum of its proper divisors (1).
122030113477 is an equidigital number, since it uses as much as digits as its factorization.
122030113477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7056, while the sum is 31.
Adding to 122030113477 its reverse (774311030221), we get a palindrome (896341143698).
The spelling of 122030113477 in words is "one hundred twenty-two billion, thirty million, one hundred thirteen thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •