Base | Representation |
---|---|
bin | 1110111110100100… |
… | …1000001100111001 |
3 | 101101012100101201020 |
4 | 3233221020030321 |
5 | 31213224123441 |
6 | 1502542013053 |
7 | 201426664440 |
oct | 35751101471 |
9 | 11335311636 |
10 | 4020536121 |
11 | 1783540328 |
12 | 942577189 |
13 | 4c0c61b74 |
14 | 2a1d7bd57 |
15 | 187e7ee66 |
hex | efa48339 |
4020536121 has 8 divisors (see below), whose sum is σ = 6126531264. Its totient is φ = 2297449200.
The previous prime is 4020536119. The next prime is 4020536129. The reversal of 4020536121 is 1216350204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4020536121 - 21 = 4020536119 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4020536091 and 4020536100.
It is not an unprimeable number, because it can be changed into a prime (4020536129) 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 7 ways as a sum of consecutive naturals, for example, 95727030 + ... + 95727071.
It is an arithmetic number, because the mean of its divisors is an integer number (765816408).
Almost surely, 24020536121 is an apocalyptic number.
It is an amenable number.
4020536121 is a deficient number, since it is larger than the sum of its proper divisors (2105995143).
4020536121 is a wasteful number, since it uses less digits than its factorization.
4020536121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191454111.
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 4020536121 is about 63407.6976478408. The cubic root of 4020536121 is about 1590.1130045074.
Adding to 4020536121 its reverse (1216350204), we get a palindrome (5236886325).
The spelling of 4020536121 in words is "four billion, twenty million, five hundred thirty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •