Base | Representation |
---|---|
bin | 11101010010011110011… |
… | …100000001010100000001 |
3 | 21010102010201110222122001 |
4 | 131102132130001110001 |
5 | 230434003411340230 |
6 | 4140342314544001 |
7 | 265261436602141 |
oct | 35223634012401 |
9 | 7112121428561 |
10 | 2012702840065 |
11 | 706645311615 |
12 | 2860aa138001 |
13 | 117a491c0b98 |
14 | 6d5b5984921 |
15 | 3754d2d20ca |
hex | 1d49e701501 |
2012702840065 has 4 divisors (see below), whose sum is σ = 2415243408084. Its totient is φ = 1610162272048.
The previous prime is 2012702840063. The next prime is 2012702840089. The reversal of 2012702840065 is 5600482072102.
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 943662644929 + 1069040195136 = 971423^2 + 1033944^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012702840065 - 21 = 2012702840063 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2012702840063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 201270284002 + ... + 201270284011.
It is an arithmetic number, because the mean of its divisors is an integer number (603810852021).
Almost surely, 22012702840065 is an apocalyptic number.
It is an amenable number.
2012702840065 is a deficient number, since it is larger than the sum of its proper divisors (402540568019).
2012702840065 is an equidigital number, since it uses as much as digits as its factorization.
2012702840065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402540568018.
The product of its (nonzero) digits is 53760, while the sum is 37.
The spelling of 2012702840065 in words is "two trillion, twelve billion, seven hundred two million, eight hundred forty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •