Base | Representation |
---|---|
bin | 101111111000000100010011… |
… | …1010001101001101000111101 |
3 | 2001020001220000100100122211121 |
4 | 1133300020213101221220331 |
5 | 420144131232242424404 |
6 | 4051352511411150541 |
7 | 154463034516142156 |
oct | 13760104721515075 |
9 | 2036056010318747 |
10 | 421122202311229 |
11 | 112200a17631771 |
12 | 3b2943795a5451 |
13 | 150c9865345003 |
14 | 75dc5cd93492d |
15 | 33a454cc07e54 |
hex | 17f0227469a3d |
421122202311229 has 2 divisors, whose sum is σ = 421122202311230. Its totient is φ = 421122202311228.
The previous prime is 421122202311143. The next prime is 421122202311247. The reversal of 421122202311229 is 922113202221124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 415512755856900 + 5609446454329 = 20384130^2 + 2368427^2 .
It is a cyclic number.
It is not a de Polignac number, because 421122202311229 - 217 = 421122202180157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 421122202311194 and 421122202311203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421122202311259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210561101155614 + 210561101155615.
It is an arithmetic number, because the mean of its divisors is an integer number (210561101155615).
Almost surely, 2421122202311229 is an apocalyptic number.
It is an amenable number.
421122202311229 is a deficient number, since it is larger than the sum of its proper divisors (1).
421122202311229 is an equidigital number, since it uses as much as digits as its factorization.
421122202311229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 34.
The spelling of 421122202311229 in words is "four hundred twenty-one trillion, one hundred twenty-two billion, two hundred two million, three hundred eleven thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •