Base | Representation |
---|---|
bin | 1100001110100000010… |
… | …01100101001010001111 |
3 | 1111011100202210101121201 |
4 | 12013100021211022033 |
5 | 23340333111001033 |
6 | 520554302410331 |
7 | 42231366040222 |
oct | 6072011451217 |
9 | 1434322711551 |
10 | 420104000143 |
11 | 15218a835253 |
12 | 69503b909a7 |
13 | 3080072a409 |
14 | 164941db5b9 |
15 | addb85947d |
hex | 61d026528f |
420104000143 has 2 divisors, whose sum is σ = 420104000144. Its totient is φ = 420104000142.
The previous prime is 420104000137. The next prime is 420104000177. The reversal of 420104000143 is 341000401024.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-420104000143 is a prime.
It is a super-2 number, since 2×4201040001432 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 420104000143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (420104000443) 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 as a sum of consecutive naturals, namely, 210052000071 + 210052000072.
It is an arithmetic number, because the mean of its divisors is an integer number (210052000072).
Almost surely, 2420104000143 is an apocalyptic number.
420104000143 is a deficient number, since it is larger than the sum of its proper divisors (1).
420104000143 is an equidigital number, since it uses as much as digits as its factorization.
420104000143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 420104000143 its reverse (341000401024), we get a palindrome (761104401167).
The spelling of 420104000143 in words is "four hundred twenty billion, one hundred four million, one hundred forty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •