Base | Representation |
---|---|
bin | 11001000010010100111101… |
… | …000101000101100011101101 |
3 | 112102212111222222021011110100 |
4 | 121002110331011011203231 |
5 | 103413030013413424323 |
6 | 1030104201442301313 |
7 | 32123156511214062 |
oct | 3102247505054355 |
9 | 472774888234410 |
10 | 110111101311213 |
11 | 320a2946110762 |
12 | 10424329057839 |
13 | 49595809baab2 |
14 | 1d295974c4c69 |
15 | cae39834e943 |
hex | 64253d1458ed |
110111101311213 has 12 divisors (see below), whose sum is σ = 159049478814460. Its totient is φ = 73407349987776.
The previous prime is 110111101311157. The next prime is 110111101311251. The reversal of 110111101311213 is 312113101111011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 28529507055204 + 81581594256009 = 5341302^2 + 9032253^2 .
It is not a de Polignac number, because 110111101311213 - 238 = 109836223404269 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110111101311283) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13269195 + ... + 19907127.
Almost surely, 2110111101311213 is an apocalyptic number.
It is an amenable number.
110111101311213 is a deficient number, since it is larger than the sum of its proper divisors (48938377503247).
110111101311213 is a wasteful number, since it uses less digits than its factorization.
110111101311213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8481068 (or 8481065 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 18.
Adding to 110111101311213 its reverse (312113101111011), we get a palindrome (422224202422224).
The spelling of 110111101311213 in words is "one hundred ten trillion, one hundred eleven billion, one hundred one million, three hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •