Base | Representation |
---|---|
bin | 11101010001010111001… |
… | …010101010001101010101 |
3 | 21010022001101111102202002 |
4 | 131101113022222031111 |
5 | 230424031304403040 |
6 | 4140023522125045 |
7 | 265220010203651 |
oct | 35212712521525 |
9 | 7108041442662 |
10 | 2011507106645 |
11 | 70609135a383 |
12 | 285a157b0785 |
13 | 1178b856170a |
14 | 6d500c45a61 |
15 | 374cd33aa15 |
hex | 1d4572aa355 |
2011507106645 has 8 divisors (see below), whose sum is σ = 2432814895104. Its totient is φ = 1596534773904.
The previous prime is 2011507106617. The next prime is 2011507106659. The reversal of 2011507106645 is 5466017051102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2011507106645 - 220 = 2011506058069 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2011507106599 and 2011507106608.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1583863229 + ... + 1583864498.
It is an arithmetic number, because the mean of its divisors is an integer number (304101861888).
Almost surely, 22011507106645 is an apocalyptic number.
It is an amenable number.
2011507106645 is a deficient number, since it is larger than the sum of its proper divisors (421307788459).
2011507106645 is a wasteful number, since it uses less digits than its factorization.
2011507106645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3167727859.
The product of its (nonzero) digits is 50400, while the sum is 38.
The spelling of 2011507106645 in words is "two trillion, eleven billion, five hundred seven million, one hundred six thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •