Base | Representation |
---|---|
bin | 101111110000010100001000… |
… | …0000001111011011111001011 |
3 | 2001002022000122220022102101220 |
4 | 1133200220100001323133023 |
5 | 420024202020032042101 |
6 | 4045215211002413123 |
7 | 154323043426430535 |
oct | 13740502001733713 |
9 | 2032260586272356 |
10 | 420056660424651 |
11 | 111930035a56368 |
12 | 3b1419658011a3 |
13 | 15050233431183 |
14 | 75a2bca9da855 |
15 | 3386987448636 |
hex | 17e0a1007b7cb |
420056660424651 has 8 divisors (see below), whose sum is σ = 563204460905280. Its totient is φ = 278473316780232.
The previous prime is 420056660424619. The next prime is 420056660424677. The reversal of 420056660424651 is 156424066650024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 420056660424651 - 25 = 420056660424619 is a prime.
It is a super-2 number, since 2×4200566604246512 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 420056660424594 and 420056660424603.
It is not an unprimeable number, because it can be changed into a prime (420056660424691) 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, 391114208425 + ... + 391114209498.
It is an arithmetic number, because the mean of its divisors is an integer number (70400557613160).
Almost surely, 2420056660424651 is an apocalyptic number.
420056660424651 is a deficient number, since it is larger than the sum of its proper divisors (143147800480629).
420056660424651 is a wasteful number, since it uses less digits than its factorization.
420056660424651 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 782228418105.
The product of its (nonzero) digits is 8294400, while the sum is 51.
The spelling of 420056660424651 in words is "four hundred twenty trillion, fifty-six billion, six hundred sixty million, four hundred twenty-four thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •