Base | Representation |
---|---|
bin | 1100010000110100011… |
… | …01100000010110101101 |
3 | 1111021120100212010000022 |
4 | 12020122031200112231 |
5 | 23400404203334041 |
6 | 521321450411525 |
7 | 42304234344215 |
oct | 6103215402655 |
9 | 1437510763008 |
10 | 421346543021 |
11 | 152768159098 |
12 | 697b0130ba5 |
13 | 3096ac989a1 |
14 | 16571243245 |
15 | ae6099a24b |
hex | 621a3605ad |
421346543021 has 4 divisors (see below), whose sum is σ = 421352864700. Its totient is φ = 421340221344.
The previous prime is 421346542987. The next prime is 421346543053. The reversal of 421346543021 is 120345643124.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 148221150025 + 273125392996 = 384995^2 + 522614^2 .
It is a cyclic number.
It is not a de Polignac number, because 421346543021 - 214 = 421346526637 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421346543221) 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 3 ways as a sum of consecutive naturals, for example, 3059786 + ... + 3194523.
It is an arithmetic number, because the mean of its divisors is an integer number (105338216175).
Almost surely, 2421346543021 is an apocalyptic number.
It is an amenable number.
421346543021 is a deficient number, since it is larger than the sum of its proper divisors (6321679).
421346543021 is an equidigital number, since it uses as much as digits as its factorization.
421346543021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6321678.
The product of its (nonzero) digits is 69120, while the sum is 35.
The spelling of 421346543021 in words is "four hundred twenty-one billion, three hundred forty-six million, five hundred forty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •