Base | Representation |
---|---|
bin | 111101011010010… |
… | …0111100111111101 |
3 | 12022121102001012021 |
4 | 1322310213213331 |
5 | 13210004123031 |
6 | 540250040141 |
7 | 102030634255 |
oct | 17264474775 |
9 | 5277361167 |
10 | 2060614141 |
11 | 9681879a3 |
12 | 496119051 |
13 | 26abaaa11 |
14 | 157956965 |
15 | c0d87511 |
hex | 7ad279fd |
2060614141 has 4 divisors (see below), whose sum is σ = 2060833984. Its totient is φ = 2060394300.
The previous prime is 2060614139. The next prime is 2060614151. The reversal of 2060614141 is 1414160602.
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 2060614141 - 21 = 2060614139 is a prime.
It is a super-2 number, since 2×20606141412 = 8492261276178335762, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2060614151) 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, 95205 + ... + 114826.
It is an arithmetic number, because the mean of its divisors is an integer number (515208496).
Almost surely, 22060614141 is an apocalyptic number.
It is an amenable number.
2060614141 is a deficient number, since it is larger than the sum of its proper divisors (219843).
2060614141 is an equidigital number, since it uses as much as digits as its factorization.
2060614141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219842.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 2060614141 is about 45393.9879389331. The cubic root of 2060614141 is about 1272.5227596049.
Adding to 2060614141 its reverse (1414160602), we get a palindrome (3474774743).
The spelling of 2060614141 in words is "two billion, sixty million, six hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •