Base | Representation |
---|---|
bin | 111101011001111… |
… | …0110110010110101 |
3 | 12022121000212211120 |
4 | 1322303312302311 |
5 | 13204431223013 |
6 | 540241454153 |
7 | 102026142201 |
oct | 17263666265 |
9 | 5277025746 |
10 | 2060414133 |
11 | 9680606a8 |
12 | 496041359 |
13 | 26ab3a97b |
14 | 157903b01 |
15 | c0d48123 |
hex | 7acf6cb5 |
2060414133 has 4 divisors (see below), whose sum is σ = 2747218848. Its totient is φ = 1373609420.
The previous prime is 2060414113. The next prime is 2060414137. The reversal of 2060414133 is 3314140602.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2060414133 - 217 = 2060283061 is a prime.
It is a super-2 number, since 2×20604141332 = 8490612798932283378, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2060414137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 343402353 + ... + 343402358.
It is an arithmetic number, because the mean of its divisors is an integer number (686804712).
Almost surely, 22060414133 is an apocalyptic number.
It is an amenable number.
2060414133 is a deficient number, since it is larger than the sum of its proper divisors (686804715).
2060414133 is an equidigital number, since it uses as much as digits as its factorization.
2060414133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 686804714.
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 2060414133 is about 45391.7848624616. The cubic root of 2060414133 is about 1272.4815869334.
Adding to 2060414133 its reverse (3314140602), we get a palindrome (5374554735).
The spelling of 2060414133 in words is "two billion, sixty million, four hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.244 sec. • engine limits •