Base | Representation |
---|---|
bin | 101111110010011110101101… |
… | …0000100110000101010001101 |
3 | 2001010100110210210210202200001 |
4 | 1133210331122010300222031 |
5 | 420044041003342033031 |
6 | 4050004025024204301 |
7 | 154353410212252003 |
oct | 13744753204605215 |
9 | 2033313723722601 |
10 | 420354255424141 |
11 | 111a35269635135 |
12 | 3b18b579769691 |
13 | 1507230bc1304c |
14 | 75b337c57aa73 |
15 | 338e5a38e4861 |
hex | 17e4f5a130a8d |
420354255424141 has 2 divisors, whose sum is σ = 420354255424142. Its totient is φ = 420354255424140.
The previous prime is 420354255424093. The next prime is 420354255424157. The reversal of 420354255424141 is 141424552453024.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 304238329420041 + 116115926004100 = 17442429^2 + 10775710^2 .
It is a cyclic number.
It is not a de Polignac number, because 420354255424141 - 229 = 420353718553229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 420354255424091 and 420354255424100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (420354255428141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210177127712070 + 210177127712071.
It is an arithmetic number, because the mean of its divisors is an integer number (210177127712071).
Almost surely, 2420354255424141 is an apocalyptic number.
It is an amenable number.
420354255424141 is a deficient number, since it is larger than the sum of its proper divisors (1).
420354255424141 is an equidigital number, since it uses as much as digits as its factorization.
420354255424141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072000, while the sum is 46.
The spelling of 420354255424141 in words is "four hundred twenty trillion, three hundred fifty-four billion, two hundred fifty-five million, four hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •