Base | Representation |
---|---|
bin | 101111110001100010000100… |
… | …0000011101110001010111101 |
3 | 2001002220000200012110011121201 |
4 | 1133203010020003232022331 |
5 | 420034422303240314323 |
6 | 4045424130550055501 |
7 | 154341120133651063 |
oct | 13743041003561275 |
9 | 2032800605404551 |
10 | 420224030401213 |
11 | 111995012a41a45 |
12 | 3b16a29564a591 |
13 | 15062c5753276c |
14 | 75aad47258033 |
15 | 338aed0e328ad |
hex | 17e31080ee2bd |
420224030401213 has 8 divisors (see below), whose sum is σ = 420691824210528. Its totient is φ = 419756246465424.
The previous prime is 420224030401163. The next prime is 420224030401237. The reversal of 420224030401213 is 312104030422024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 420224030401213 - 217 = 420224030270141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420224030401283) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84400695 + ... + 89240827.
It is an arithmetic number, because the mean of its divisors is an integer number (52586478026316).
Almost surely, 2420224030401213 is an apocalyptic number.
It is an amenable number.
420224030401213 is a deficient number, since it is larger than the sum of its proper divisors (467793809315).
420224030401213 is an equidigital number, since it uses as much as digits as its factorization.
420224030401213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4936763.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 420224030401213 its reverse (312104030422024), we get a palindrome (732328060823237).
The spelling of 420224030401213 in words is "four hundred twenty trillion, two hundred twenty-four billion, thirty million, four hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •