Base | Representation |
---|---|
bin | 111101011001101… |
… | …0010101010010101 |
3 | 12022120202100211002 |
4 | 1322303102222111 |
5 | 13204412004013 |
6 | 540234353045 |
7 | 102024654542 |
oct | 17263225225 |
9 | 5276670732 |
10 | 2060266133 |
11 | 967a6a492 |
12 | 495b8b785 |
13 | 26aab84b3 |
14 | 1578a5bc9 |
15 | c0d19358 |
hex | 7acd2a95 |
2060266133 has 2 divisors, whose sum is σ = 2060266134. Its totient is φ = 2060266132.
The previous prime is 2060266127. The next prime is 2060266171. The reversal of 2060266133 is 3316620602.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1232150404 + 828115729 = 35102^2 + 28777^2 .
It is a cyclic number.
It is not a de Polignac number, because 2060266133 - 26 = 2060266069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2060266096 and 2060266105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2060266183) 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 as a sum of consecutive naturals, namely, 1030133066 + 1030133067.
It is an arithmetic number, because the mean of its divisors is an integer number (1030133067).
Almost surely, 22060266133 is an apocalyptic number.
It is an amenable number.
2060266133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2060266133 is an equidigital number, since it uses as much as digits as its factorization.
2060266133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
The square root of 2060266133 is about 45390.1545822439. The cubic root of 2060266133 is about 1272.4511186599.
Adding to 2060266133 its reverse (3316620602), we get a palindrome (5376886735).
The spelling of 2060266133 in words is "two billion, sixty million, two hundred sixty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •