Base | Representation |
---|---|
bin | 111011111101110… |
… | …1100000000011101 |
3 | 12012020012001221022 |
4 | 1313323230000131 |
5 | 13110101313303 |
6 | 531355013525 |
7 | 100601604056 |
oct | 16773540035 |
9 | 5166161838 |
10 | 2012135453 |
11 | 942886169 |
12 | 481a3a2a5 |
13 | 260b35bc3 |
14 | 15133772d |
15 | bb9ad438 |
hex | 77eec01d |
2012135453 has 4 divisors (see below), whose sum is σ = 2130496380. Its totient is φ = 1893774528.
The previous prime is 2012135441. The next prime is 2012135483. The reversal of 2012135453 is 3545312102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 737502649 + 1274632804 = 27157^2 + 35702^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012135453 - 212 = 2012131357 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012135483) 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, 59180438 + ... + 59180471.
It is an arithmetic number, because the mean of its divisors is an integer number (532624095).
Almost surely, 22012135453 is an apocalyptic number.
It is an amenable number.
2012135453 is a deficient number, since it is larger than the sum of its proper divisors (118360927).
2012135453 is a wasteful number, since it uses less digits than its factorization.
2012135453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118360926.
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 2012135453 is about 44856.8328462900. The cubic root of 2012135453 is about 1262.4641985469.
Adding to 2012135453 its reverse (3545312102), we get a palindrome (5557447555).
The spelling of 2012135453 in words is "two billion, twelve million, one hundred thirty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •