Base | Representation |
---|---|
bin | 111000111010100010… |
… | …0001111100110001101 |
3 | 102200110221101100221102 |
4 | 1301311010033212031 |
5 | 4000303110143041 |
6 | 132052025512445 |
7 | 11554542320645 |
oct | 1616504174615 |
9 | 380427340842 |
10 | 122223131021 |
11 | 4791a853392 |
12 | 1b830342725 |
13 | b6aa957304 |
14 | 5cb66c5525 |
15 | 32a524109b |
hex | 1c7510f98d |
122223131021 has 2 divisors, whose sum is σ = 122223131022. Its totient is φ = 122223131020.
The previous prime is 122223130999. The next prime is 122223131033. The reversal of 122223131021 is 120131322221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121425068521 + 798062500 = 348461^2 + 28250^2 .
It is a cyclic number.
It is not a de Polignac number, because 122223131021 - 230 = 121149389197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122223130984 and 122223131002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122223131321) 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, 61111565510 + 61111565511.
It is an arithmetic number, because the mean of its divisors is an integer number (61111565511).
Almost surely, 2122223131021 is an apocalyptic number.
It is an amenable number.
122223131021 is a deficient number, since it is larger than the sum of its proper divisors (1).
122223131021 is an equidigital number, since it uses as much as digits as its factorization.
122223131021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 122223131021 its reverse (120131322221), we get a palindrome (242354453242).
The spelling of 122223131021 in words is "one hundred twenty-two billion, two hundred twenty-three million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •