Base | Representation |
---|---|
bin | 101100011101001100001… |
… | …1100000111001010011001 |
3 | 210122002222110211101112120 |
4 | 1120322120130013022121 |
5 | 1300101240224013423 |
6 | 20554521250131453 |
7 | 1200301343411262 |
oct | 130723034071231 |
9 | 23562873741476 |
10 | 6110001001113 |
11 | 1a46267306729 |
12 | 8281aab80b89 |
13 | 35422ab1a579 |
14 | 171a23193969 |
15 | a8e061cbee3 |
hex | 58e98707299 |
6110001001113 has 8 divisors (see below), whose sum is σ = 8147907818976. Its totient is φ = 4072714092000.
The previous prime is 6110001001109. The next prime is 6110001001129. The reversal of 6110001001113 is 3111001000116.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6110001001113 - 22 = 6110001001109 is a prime.
It is a super-2 number, since 2×61100010011132 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6110001001092 and 6110001001101.
It is not an unprimeable number, because it can be changed into a prime (6110001001813) 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, 154954188 + ... + 154993613.
It is an arithmetic number, because the mean of its divisors is an integer number (1018488477372).
Almost surely, 26110001001113 is an apocalyptic number.
It is an amenable number.
6110001001113 is a deficient number, since it is larger than the sum of its proper divisors (2037906817863).
6110001001113 is a wasteful number, since it uses less digits than its factorization.
6110001001113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 309954375.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 6110001001113 its reverse (3111001000116), we get a palindrome (9221002001229).
The spelling of 6110001001113 in words is "six trillion, one hundred ten billion, one million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •