Base | Representation |
---|---|
bin | 1100001110011100011… |
… | …00110110100011001001 |
3 | 1111011021111021020002002 |
4 | 12013032030312203021 |
5 | 23340301223201434 |
6 | 520551133520345 |
7 | 42230521110314 |
oct | 6071614664311 |
9 | 1434244236062 |
10 | 420071303369 |
11 | 152173332723 |
12 | 694b50430b5 |
13 | 307c6a1cb03 |
14 | 1648db2997b |
15 | add8a4b57e |
hex | 61ce3368c9 |
420071303369 has 2 divisors, whose sum is σ = 420071303370. Its totient is φ = 420071303368.
The previous prime is 420071303359. The next prime is 420071303371. The reversal of 420071303369 is 963303170024.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 343653888400 + 76417414969 = 586220^2 + 276437^2 .
It is a cyclic number.
It is not a de Polignac number, because 420071303369 - 212 = 420071299273 is a prime.
It is a super-2 number, since 2×4200713033692 (a number of 24 digits) contains 22 as substring.
Together with 420071303371, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (420071303359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210035651684 + 210035651685.
It is an arithmetic number, because the mean of its divisors is an integer number (210035651685).
Almost surely, 2420071303369 is an apocalyptic number.
It is an amenable number.
420071303369 is a deficient number, since it is larger than the sum of its proper divisors (1).
420071303369 is an equidigital number, since it uses as much as digits as its factorization.
420071303369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 38.
The spelling of 420071303369 in words is "four hundred twenty billion, seventy-one million, three hundred three thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •