Base | Representation |
---|---|
bin | 111011111110011… |
… | …1001101100001001 |
3 | 12012020210020102001 |
4 | 1313330321230021 |
5 | 13110142004031 |
6 | 531405511001 |
7 | 100604400532 |
oct | 16774715411 |
9 | 5166706361 |
10 | 2012453641 |
11 | 942a83230 |
12 | 481b72461 |
13 | 260c17993 |
14 | 1513bb689 |
15 | bba22861 |
hex | 77f39b09 |
2012453641 has 4 divisors (see below), whose sum is σ = 2195403984. Its totient is φ = 1829503300.
The previous prime is 2012453627. The next prime is 2012453657. The reversal of 2012453641 is 1463542102.
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 2012453641 - 29 = 2012453129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2012453141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91475155 + ... + 91475176.
It is an arithmetic number, because the mean of its divisors is an integer number (548850996).
Almost surely, 22012453641 is an apocalyptic number.
It is an amenable number.
2012453641 is a deficient number, since it is larger than the sum of its proper divisors (182950343).
2012453641 is a wasteful number, since it uses less digits than its factorization.
2012453641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182950342.
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 2012453641 is about 44860.3794121271. The cubic root of 2012453641 is about 1262.5307414140.
Adding to 2012453641 its reverse (1463542102), we get a palindrome (3475995743).
The spelling of 2012453641 in words is "two billion, twelve million, four hundred fifty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •