Base | Representation |
---|---|
bin | 111000110110000110… |
… | …1000100110110000101 |
3 | 102200002120121122202022 |
4 | 1301230031010312011 |
5 | 4000002024420313 |
6 | 132025155052525 |
7 | 11551055500322 |
oct | 1615415046605 |
9 | 380076548668 |
10 | 122074451333 |
11 | 4785393310a |
12 | 1b7aa5a1145 |
13 | b685bcb373 |
14 | 5ca0a61b49 |
15 | 3297172c08 |
hex | 1c6c344d85 |
122074451333 has 2 divisors, whose sum is σ = 122074451334. Its totient is φ = 122074451332.
The previous prime is 122074451311. The next prime is 122074451339. The reversal of 122074451333 is 333154470221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119372323009 + 2702128324 = 345503^2 + 51982^2 .
It is an emirp because it is prime and its reverse (333154470221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122074451333 - 226 = 122007342469 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122074451293 and 122074451302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122074451339) 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, 61037225666 + 61037225667.
It is an arithmetic number, because the mean of its divisors is an integer number (61037225667).
Almost surely, 2122074451333 is an apocalyptic number.
It is an amenable number.
122074451333 is a deficient number, since it is larger than the sum of its proper divisors (1).
122074451333 is an equidigital number, since it uses as much as digits as its factorization.
122074451333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 35.
The spelling of 122074451333 in words is "one hundred twenty-two billion, seventy-four million, four hundred fifty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •