Base | Representation |
---|---|
bin | 111011111111001… |
… | …1101000110101001 |
3 | 12012021112220222112 |
4 | 1313332131012221 |
5 | 13110243021331 |
6 | 531422332105 |
7 | 100611014645 |
oct | 16776350651 |
9 | 5167486875 |
10 | 2012860841 |
11 | 943231162 |
12 | 48212a035 |
13 | 26102b124 |
14 | 151485c25 |
15 | bbaa332b |
hex | 77f9d1a9 |
2012860841 has 4 divisors (see below), whose sum is σ = 2015260800. Its totient is φ = 2010460884.
The previous prime is 2012860789. The next prime is 2012860849. The reversal of 2012860841 is 1480682102.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1480682102 = 2 ⋅740341051.
It is a cyclic number.
It is not a de Polignac number, because 2012860841 - 26 = 2012860777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2012860798 and 2012860807.
It is not an unprimeable number, because it can be changed into a prime (2012860849) 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, 1198721 + ... + 1200398.
It is an arithmetic number, because the mean of its divisors is an integer number (503815200).
Almost surely, 22012860841 is an apocalyptic number.
It is an amenable number.
2012860841 is a deficient number, since it is larger than the sum of its proper divisors (2399959).
2012860841 is an equidigital number, since it uses as much as digits as its factorization.
2012860841 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2399958.
The product of its (nonzero) digits is 6144, while the sum is 32.
The square root of 2012860841 is about 44864.9177086061. The cubic root of 2012860841 is about 1262.6158891886.
The spelling of 2012860841 in words is "two billion, twelve million, eight hundred sixty thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •