Base | Representation |
---|---|
bin | 111011111101101… |
… | …0100110101101101 |
3 | 12012020000020202122 |
4 | 1313323110311231 |
5 | 13110040244212 |
6 | 531353002325 |
7 | 100601030312 |
oct | 16773246555 |
9 | 5166006678 |
10 | 2012040557 |
11 | 94282093a |
12 | 4819b33a5 |
13 | 260b01957 |
14 | 151310d09 |
15 | bb990272 |
hex | 77ed4d6d |
2012040557 has 4 divisors (see below), whose sum is σ = 2012169600. Its totient is φ = 2011911516.
The previous prime is 2012040551. The next prime is 2012040571. The reversal of 2012040557 is 7550402102.
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: 7550402102 = 2 ⋅3775201051.
It is a cyclic number.
It is not a de Polignac number, because 2012040557 - 28 = 2012040301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012040551) 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, 37307 + ... + 73592.
It is an arithmetic number, because the mean of its divisors is an integer number (503042400).
Almost surely, 22012040557 is an apocalyptic number.
It is an amenable number.
2012040557 is a deficient number, since it is larger than the sum of its proper divisors (129043).
2012040557 is a wasteful number, since it uses less digits than its factorization.
2012040557 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129042.
The product of its (nonzero) digits is 2800, while the sum is 26.
The square root of 2012040557 is about 44855.7750685461. The cubic root of 2012040557 is about 1262.4443515255. Note that the first 3 decimals are identical.
Adding to 2012040557 its reverse (7550402102), we get a palindrome (9562442659).
The spelling of 2012040557 in words is "two billion, twelve million, forty thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •