Base | Representation |
---|---|
bin | 11101010010000010010… |
… | …001011011100100111101 |
3 | 21010100220210022120021201 |
4 | 131102002101123210331 |
5 | 230432021424131023 |
6 | 4140223354455501 |
7 | 265243641233161 |
oct | 35220221334475 |
9 | 7110823276251 |
10 | 2012230302013 |
11 | 7064226017a8 |
12 | 285b97a34591 |
13 | 1179a2332779 |
14 | 6d56ccdaca1 |
15 | 37521a90bad |
hex | 1d48245b93d |
2012230302013 has 8 divisors (see below), whose sum is σ = 2022699982968. Its totient is φ = 2001761071104.
The previous prime is 2012230301959. The next prime is 2012230302079. The reversal of 2012230302013 is 3102030322102.
It can be written as a sum of positive squares in 4 ways, for example, as 6772137849 + 2005458164164 = 82293^2 + 1416142^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012230302013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012230302413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12541131 + ... + 12700567.
It is an arithmetic number, because the mean of its divisors is an integer number (252837497871).
Almost surely, 22012230302013 is an apocalyptic number.
It is an amenable number.
2012230302013 is a deficient number, since it is larger than the sum of its proper divisors (10469680955).
2012230302013 is a wasteful number, since it uses less digits than its factorization.
2012230302013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 225023.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2012230302013 its reverse (3102030322102), we get a palindrome (5114260624115).
The spelling of 2012230302013 in words is "two trillion, twelve billion, two hundred thirty million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •