Base | Representation |
---|---|
bin | 111100011000010… |
… | …1001110100100101 |
3 | 12020012022111010201 |
4 | 1320300221310211 |
5 | 13122130121013 |
6 | 533012350501 |
7 | 101130613144 |
oct | 17060516445 |
9 | 5205274121 |
10 | 2026020133 |
11 | 94a6a9a05 |
12 | 486615431 |
13 | 2639879a7 |
14 | 15310d75b |
15 | bcd023dd |
hex | 78c29d25 |
2026020133 has 2 divisors, whose sum is σ = 2026020134. Its totient is φ = 2026020132.
The previous prime is 2026020131. The next prime is 2026020163. The reversal of 2026020133 is 3310206202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1877228929 + 148791204 = 43327^2 + 12198^2 .
It is a cyclic number.
It is not a de Polignac number, because 2026020133 - 21 = 2026020131 is a prime.
Together with 2026020131, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 2026020133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2026020131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1013010066 + 1013010067.
It is an arithmetic number, because the mean of its divisors is an integer number (1013010067).
Almost surely, 22026020133 is an apocalyptic number.
It is an amenable number.
2026020133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2026020133 is an equidigital number, since it uses as much as digits as its factorization.
2026020133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 2026020133 is about 45011.3333839379. Note that the first 4 decimals coincide. The cubic root of 2026020133 is about 1265.3614100643.
Adding to 2026020133 its reverse (3310206202), we get a palindrome (5336226335).
The spelling of 2026020133 in words is "two billion, twenty-six million, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.221 sec. • engine limits •