Base | Representation |
---|---|
bin | 11001001000100100110111… |
… | …100010100100001011011001 |
3 | 112111101120100212021000210212 |
4 | 121020210313202210023121 |
5 | 103442043423301330423 |
6 | 1031033335040020505 |
7 | 32166200523225536 |
oct | 3110446742441331 |
9 | 474346325230725 |
10 | 110540505105113 |
11 | 32248a6838a676 |
12 | 104935a7601735 |
13 | 498ac04023445 |
14 | 1d42290855d8d |
15 | cba62b353578 |
hex | 6489378a42d9 |
110540505105113 has 8 divisors (see below), whose sum is σ = 110796349910400. Its totient is φ = 110284729827280.
The previous prime is 110540505105101. The next prime is 110540505105119. The reversal of 110540505105113 is 311501505045011.
It is a happy number.
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 110540505105113 - 234 = 110523325235929 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 110540505105113.
It is not an unprimeable number, because it can be changed into a prime (110540505105119) 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, 14197745 + ... + 20558622.
It is an arithmetic number, because the mean of its divisors is an integer number (13849543738800).
Almost surely, 2110540505105113 is an apocalyptic number.
It is an amenable number.
110540505105113 is a deficient number, since it is larger than the sum of its proper divisors (255844805287).
110540505105113 is an equidigital number, since it uses as much as digits as its factorization.
110540505105113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34763727.
The product of its (nonzero) digits is 7500, while the sum is 32.
The spelling of 110540505105113 in words is "one hundred ten trillion, five hundred forty billion, five hundred five million, one hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •