Base | Representation |
---|---|
bin | 111010100000010011010… |
… | …111100110010100010101 |
3 | 112020100101120212202010111 |
4 | 322200103113212110111 |
5 | 1011332302032424141 |
6 | 12314541452123021 |
7 | 563315421025321 |
oct | 72402327462425 |
9 | 15210346782114 |
10 | 4020414342421 |
11 | 13100590a2244 |
12 | 54b224766471 |
13 | 23217b296ba9 |
14 | dc836680981 |
15 | 6e8a82be381 |
hex | 3a8135e6515 |
4020414342421 has 2 divisors, whose sum is σ = 4020414342422. Its totient is φ = 4020414342420.
The previous prime is 4020414342403. The next prime is 4020414342437. The reversal of 4020414342421 is 1242434140204.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3765501440100 + 254912902321 = 1940490^2 + 504889^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4020414342421 is a prime.
It is a super-3 number, since 3×40204143424213 (a number of 39 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4020414342401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2010207171210 + 2010207171211.
It is an arithmetic number, because the mean of its divisors is an integer number (2010207171211).
Almost surely, 24020414342421 is an apocalyptic number.
It is an amenable number.
4020414342421 is a deficient number, since it is larger than the sum of its proper divisors (1).
4020414342421 is an equidigital number, since it uses as much as digits as its factorization.
4020414342421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24576, while the sum is 31.
Adding to 4020414342421 its reverse (1242434140204), we get a palindrome (5262848482625).
The spelling of 4020414342421 in words is "four trillion, twenty billion, four hundred fourteen million, three hundred forty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •