Base | Representation |
---|---|
bin | 11101010000100101011… |
… | …111111000111110001101 |
3 | 21010012220022111122111001 |
4 | 131100211133320332031 |
5 | 230420324443430331 |
6 | 4135405113500301 |
7 | 265160241255406 |
oct | 35204537707615 |
9 | 7105808448431 |
10 | 2010673811341 |
11 | 7057a3a48278 |
12 | 285822711691 |
13 | 1177b4a21980 |
14 | 6d4622d09ad |
15 | 374800d8561 |
hex | 1d4257f8f8d |
2010673811341 has 8 divisors (see below), whose sum is σ = 2279306345120. Its totient is φ = 1758322037232.
The previous prime is 2010673811327. The next prime is 2010673811359. The reversal of 2010673811341 is 1431183760102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2010673811341 - 29 = 2010673810829 is a prime.
It is a super-2 number, since 2×20106738113412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2010673811341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010673818341) 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, 4070189655 + ... + 4070190148.
It is an arithmetic number, because the mean of its divisors is an integer number (284913293140).
Almost surely, 22010673811341 is an apocalyptic number.
It is an amenable number.
2010673811341 is a deficient number, since it is larger than the sum of its proper divisors (268632533779).
2010673811341 is a wasteful number, since it uses less digits than its factorization.
2010673811341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8140379835.
The product of its (nonzero) digits is 24192, while the sum is 37.
The spelling of 2010673811341 in words is "two trillion, ten billion, six hundred seventy-three million, eight hundred eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •