Base | Representation |
---|---|
bin | 1100001110011000110… |
… | …10100100000000101111 |
3 | 1111011012101220002012122 |
4 | 12013030122210000233 |
5 | 23340221040434043 |
6 | 520544143423155 |
7 | 42230005335341 |
oct | 6071432440057 |
9 | 1434171802178 |
10 | 420041343023 |
11 | 15215842a005 |
12 | 694a6bb4abb |
13 | 307c075cbb3 |
14 | 16489b6b291 |
15 | add60ce368 |
hex | 61cc6a402f |
420041343023 has 4 divisors (see below), whose sum is σ = 427160687880. Its totient is φ = 412921998168.
The previous prime is 420041343013. The next prime is 420041343053. The reversal of 420041343023 is 320343140024.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 420041343023 - 238 = 145163436079 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 420041342983 and 420041343001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420041343013) 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, 3559672340 + ... + 3559672457.
It is an arithmetic number, because the mean of its divisors is an integer number (106790171970).
Almost surely, 2420041343023 is an apocalyptic number.
420041343023 is a deficient number, since it is larger than the sum of its proper divisors (7119344857).
420041343023 is an equidigital number, since it uses as much as digits as its factorization.
420041343023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7119344856.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 420041343023 its reverse (320343140024), we get a palindrome (740384483047).
The spelling of 420041343023 in words is "four hundred twenty billion, forty-one million, three hundred forty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •