Base | Representation |
---|---|
bin | 11001000001010011111101… |
… | …010000100100010100000011 |
3 | 112102121211212011200012201201 |
4 | 121001103331100210110003 |
5 | 103410404101120232321 |
6 | 1030012140324042031 |
7 | 32115136162221016 |
oct | 3101237520442403 |
9 | 472554764605651 |
10 | 110041311102211 |
11 | 32076292389785 |
12 | 104128b0533317 |
13 | 4952b0ab78138 |
14 | 1d260566bd37d |
15 | cac66137e291 |
hex | 6414fd424503 |
110041311102211 has 8 divisors (see below), whose sum is σ = 110850521286960. Its totient is φ = 109232351575968.
The previous prime is 110041311102137. The next prime is 110041311102251. The reversal of 110041311102211 is 112201113140011.
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 110041311102211 - 213 = 110041311094019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110041311102251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61783336 + ... + 63539461.
It is an arithmetic number, because the mean of its divisors is an integer number (13856315160870).
Almost surely, 2110041311102211 is an apocalyptic number.
110041311102211 is a deficient number, since it is larger than the sum of its proper divisors (809210184749).
110041311102211 is a wasteful number, since it uses less digits than its factorization.
110041311102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125329253.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 110041311102211 its reverse (112201113140011), we get a palindrome (222242424242222).
The spelling of 110041311102211 in words is "one hundred ten trillion, forty-one billion, three hundred eleven million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •