Base | Representation |
---|---|
bin | 11101010010001001101… |
… | …001110110110011101001 |
3 | 21010101020102100110122000 |
4 | 131102021221312303221 |
5 | 230432300130124023 |
6 | 4140243541121213 |
7 | 265250004003015 |
oct | 35221151666351 |
9 | 7111212313560 |
10 | 2012354145513 |
11 | 7064864a91a8 |
12 | 2860113b9209 |
13 | 1179c1ba3c4a |
14 | 6d581537545 |
15 | 3752c8a5243 |
hex | 1d489a76ce9 |
2012354145513 has 16 divisors (see below), whose sum is σ = 2981483227200. Its totient is φ = 1341471408480.
The previous prime is 2012354145509. The next prime is 2012354145517. The reversal of 2012354145513 is 3155414532102.
2012354145513 is a `hidden beast` number, since 2 + 0 + 1 + 23 + 541 + 45 + 51 + 3 = 666.
It is an interprime number because it is at equal distance from previous prime (2012354145509) and next prime (2012354145517).
It is not a de Polignac number, because 2012354145513 - 22 = 2012354145509 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2012354145517) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2345503 + ... + 3086436.
It is an arithmetic number, because the mean of its divisors is an integer number (186342701700).
Almost surely, 22012354145513 is an apocalyptic number.
It is an amenable number.
2012354145513 is a deficient number, since it is larger than the sum of its proper divisors (969129081687).
2012354145513 is a wasteful number, since it uses less digits than its factorization.
2012354145513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5445669 (or 5445663 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
Adding to 2012354145513 its reverse (3155414532102), we get a palindrome (5167768677615).
The spelling of 2012354145513 in words is "two trillion, twelve billion, three hundred fifty-four million, one hundred forty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •