Base | Representation |
---|---|
bin | 111100011000010… |
… | …1110110011001001 |
3 | 12020012100112002211 |
4 | 1320300232303021 |
5 | 13122131244041 |
6 | 533013025121 |
7 | 101131026451 |
oct | 17060566311 |
9 | 5205315084 |
10 | 2026040521 |
11 | 94a71325a |
12 | 4866251a1 |
13 | 26399405b |
14 | 153116d61 |
15 | bcd08481 |
hex | 78c2ecc9 |
2026040521 has 2 divisors, whose sum is σ = 2026040522. Its totient is φ = 2026040520.
The previous prime is 2026040483. The next prime is 2026040531. The reversal of 2026040521 is 1250406202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1714870921 + 311169600 = 41411^2 + 17640^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2026040521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2026040492 and 2026040501.
It is not a weakly prime, because it can be changed into another prime (2026040531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1013020260 + 1013020261.
It is an arithmetic number, because the mean of its divisors is an integer number (1013020261).
Almost surely, 22026040521 is an apocalyptic number.
It is an amenable number.
2026040521 is a deficient number, since it is larger than the sum of its proper divisors (1).
2026040521 is an equidigital number, since it uses as much as digits as its factorization.
2026040521 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 960, while the sum is 22.
The square root of 2026040521 is about 45011.5598596627. The cubic root of 2026040521 is about 1265.3656545272.
Adding to 2026040521 its reverse (1250406202), we get a palindrome (3276446723).
It can be divided in two parts, 20260 and 40521, that multiplied together give a triangular number (820955460 = T40520).
The spelling of 2026040521 in words is "two billion, twenty-six million, forty thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •