Base | Representation |
---|---|
bin | 101111111010010000000100… |
… | …0010001111101111011011101 |
3 | 2001021010120200202120112020002 |
4 | 1133310200020101331323131 |
5 | 420214040412440330412 |
6 | 4052142425025304045 |
7 | 154523521124406233 |
oct | 13764401021757335 |
9 | 2037116622515202 |
10 | 421422330011357 |
11 | 11230722a919a64 |
12 | 3b322579795025 |
13 | 1511bc5576560c |
14 | 760cd419d8953 |
15 | 33ac2666dddc2 |
hex | 17f480847dedd |
421422330011357 has 2 divisors, whose sum is σ = 421422330011358. Its totient is φ = 421422330011356.
The previous prime is 421422330011237. The next prime is 421422330011377. The reversal of 421422330011357 is 753110033224124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 403353760501561 + 18068569509796 = 20083669^2 + 4250714^2 .
It is a cyclic number.
It is not a de Polignac number, because 421422330011357 - 238 = 421147452104413 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 421422330011357.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421422330011377) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210711165005678 + 210711165005679.
It is an arithmetic number, because the mean of its divisors is an integer number (210711165005679).
Almost surely, 2421422330011357 is an apocalyptic number.
It is an amenable number.
421422330011357 is a deficient number, since it is larger than the sum of its proper divisors (1).
421422330011357 is an equidigital number, since it uses as much as digits as its factorization.
421422330011357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 38.
The spelling of 421422330011357 in words is "four hundred twenty-one trillion, four hundred twenty-two billion, three hundred thirty million, eleven thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •