Base | Representation |
---|---|
bin | 10001101000000100110… |
… | …00101101010111000101 |
3 | 2010220020102111001021220 |
4 | 20310002120231113011 |
5 | 34410312341423141 |
6 | 1142120041430553 |
7 | 61520041430625 |
oct | 10640230552705 |
9 | 2126212431256 |
10 | 605630420421 |
11 | 213934646814 |
12 | 9946049b459 |
13 | 451592a6120 |
14 | 21453d6a885 |
15 | 10b49300766 |
hex | 8d0262d5c5 |
605630420421 has 8 divisors (see below), whose sum is σ = 869623167840. Its totient is φ = 372695643312.
The previous prime is 605630420359. The next prime is 605630420441. The reversal of 605630420421 is 124024036506.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 605630420421 - 29 = 605630419909 is a prime.
It is a super-2 number, since 2×6056304204212 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (605630420441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7764492531 + ... + 7764492608.
It is an arithmetic number, because the mean of its divisors is an integer number (108702895980).
Almost surely, 2605630420421 is an apocalyptic number.
It is an amenable number.
605630420421 is a deficient number, since it is larger than the sum of its proper divisors (263992747419).
605630420421 is a wasteful number, since it uses less digits than its factorization.
605630420421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15528985155.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 605630420421 its reverse (124024036506), we get a palindrome (729654456927).
The spelling of 605630420421 in words is "six hundred five billion, six hundred thirty million, four hundred twenty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •