Base | Representation |
---|---|
bin | 1110111110011110… |
… | …0101010011001101 |
3 | 101101011120211000112 |
4 | 3233213211103031 |
5 | 31213123143041 |
6 | 1502525205405 |
7 | 201423356414 |
oct | 35747452315 |
9 | 11334524015 |
10 | 4020131021 |
11 | 1783293a35 |
12 | 942400865 |
13 | 4c0b4c66a |
14 | 2a1cb447b |
15 | 187deedeb |
hex | ef9e54cd |
4020131021 has 2 divisors, whose sum is σ = 4020131022. Its totient is φ = 4020131020.
The previous prime is 4020130991. The next prime is 4020131029. The reversal of 4020131021 is 1201310204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2372664100 + 1647466921 = 48710^2 + 40589^2 .
It is a cyclic number.
It is not a de Polignac number, because 4020131021 - 26 = 4020130957 is a prime.
It is a super-2 number, since 2×40201310212 = 32322906852013004882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4020130987 and 4020131005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4020131029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2010065510 + 2010065511.
It is an arithmetic number, because the mean of its divisors is an integer number (2010065511).
Almost surely, 24020131021 is an apocalyptic number.
It is an amenable number.
4020131021 is a deficient number, since it is larger than the sum of its proper divisors (1).
4020131021 is an equidigital number, since it uses as much as digits as its factorization.
4020131021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 4020131021 is about 63404.5031602646. The cubic root of 4020131021 is about 1590.0595973336.
Adding to 4020131021 its reverse (1201310204), we get a palindrome (5221441225).
The spelling of 4020131021 in words is "four billion, twenty million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •