Base | Representation |
---|---|
bin | 110000000001011… |
… | …0001100101010001 |
3 | 11011022000120002110 |
4 | 1200002301211101 |
5 | 11300000340423 |
6 | 423520335533 |
7 | 54634110405 |
oct | 14002614521 |
9 | 4138016073 |
10 | 1611340113 |
11 | 757617749 |
12 | 38b7745a9 |
13 | 1c8aa65b6 |
14 | 114007105 |
15 | 966de193 |
hex | 600b1951 |
1611340113 has 8 divisors (see below), whose sum is σ = 2158636576. Its totient is φ = 1069135200.
The previous prime is 1611340097. The next prime is 1611340123. The reversal of 1611340113 is 3110431161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1611340113 - 24 = 1611340097 is a prime.
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 1611340113.
It is not an unprimeable number, because it can be changed into a prime (1611340123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1272148 + ... + 1273413.
It is an arithmetic number, because the mean of its divisors is an integer number (269829572).
Almost surely, 21611340113 is an apocalyptic number.
It is an amenable number.
1611340113 is a deficient number, since it is larger than the sum of its proper divisors (547296463).
1611340113 is a wasteful number, since it uses less digits than its factorization.
1611340113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2545775.
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 1611340113 is about 40141.5011303763. The cubic root of 1611340113 is about 1172.3638169840.
Adding to 1611340113 its reverse (3110431161), we get a palindrome (4721771274).
The spelling of 1611340113 in words is "one billion, six hundred eleven million, three hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •