Base | Representation |
---|---|
bin | 111000111001111000… |
… | …0000101011111001001 |
3 | 102200102101212112020112 |
4 | 1301303300011133021 |
5 | 4000231433211023 |
6 | 132045521004105 |
7 | 11554153644455 |
oct | 1616360053711 |
9 | 380371775215 |
10 | 122201069513 |
11 | 47909355236 |
12 | 1b824a83635 |
13 | b6a6201773 |
14 | 5cb37c1665 |
15 | 32a3334478 |
hex | 1c73c057c9 |
122201069513 has 2 divisors, whose sum is σ = 122201069514. Its totient is φ = 122201069512.
The previous prime is 122201069467. The next prime is 122201069537. The reversal of 122201069513 is 315960102221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122102722624 + 98346889 = 349432^2 + 9917^2 .
It is an emirp because it is prime and its reverse (315960102221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122201069513 - 212 = 122201065417 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122201069513.
It is not a weakly prime, because it can be changed into another prime (122201069593) 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, 61100534756 + 61100534757.
It is an arithmetic number, because the mean of its divisors is an integer number (61100534757).
Almost surely, 2122201069513 is an apocalyptic number.
It is an amenable number.
122201069513 is a deficient number, since it is larger than the sum of its proper divisors (1).
122201069513 is an equidigital number, since it uses as much as digits as its factorization.
122201069513 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 32.
The spelling of 122201069513 in words is "one hundred twenty-two billion, two hundred one million, sixty-nine thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •