Base | Representation |
---|---|
bin | 11101010010011111000… |
… | …110111100110001001001 |
3 | 21010102011111122201122011 |
4 | 131102133012330301021 |
5 | 230434014301444031 |
6 | 4140343400055521 |
7 | 265261634342326 |
oct | 35223706746111 |
9 | 7112144581564 |
10 | 2012714093641 |
11 | 7066506a8599 |
12 | 2860b1a645a1 |
13 | 117a4b6311c4 |
14 | 6d5b7273b4d |
15 | 3754e2a66b1 |
hex | 1d49f1bcc49 |
2012714093641 has 2 divisors, whose sum is σ = 2012714093642. Its totient is φ = 2012714093640.
The previous prime is 2012714093639. The next prime is 2012714093657. The reversal of 2012714093641 is 1463904172102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2005608278025 + 7105815616 = 1416195^2 + 84296^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012714093641 - 21 = 2012714093639 is a prime.
It is a super-2 number, since 2×20127140936412 (a number of 25 digits) contains 22 as substring.
Together with 2012714093639, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2012714093594 and 2012714093603.
It is not a weakly prime, because it can be changed into another prime (2012714096641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006357046820 + 1006357046821.
It is an arithmetic number, because the mean of its divisors is an integer number (1006357046821).
Almost surely, 22012714093641 is an apocalyptic number.
It is an amenable number.
2012714093641 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012714093641 is an equidigital number, since it uses as much as digits as its factorization.
2012714093641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72576, while the sum is 40.
The spelling of 2012714093641 in words is "two trillion, twelve billion, seven hundred fourteen million, ninety-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •