Base | Representation |
---|---|
bin | 11001000000110111111011… |
… | …001010100101110100011011 |
3 | 112102111222011110102021000111 |
4 | 121000313323022211310123 |
5 | 103404410430032210021 |
6 | 1025550241442545151 |
7 | 32113022240316166 |
oct | 3100677312456433 |
9 | 472458143367014 |
10 | 110011211210011 |
11 | 32064546818211 |
12 | 10408ab00681b7 |
13 | 4950021ba9637 |
14 | 1d247dccb0add |
15 | cab99dac28e1 |
hex | 640dfb2a5d1b |
110011211210011 has 4 divisors (see below), whose sum is σ = 110248816418272. Its totient is φ = 109773606001752.
The previous prime is 110011211209997. The next prime is 110011211210093. The reversal of 110011211210011 is 110012112110011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110011211210011 - 27 = 110011211209883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110011211209973 and 110011211210000.
It is not an unprimeable number, because it can be changed into a prime (110011211213011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 118802603436 + ... + 118802604361.
It is an arithmetic number, because the mean of its divisors is an integer number (27562204104568).
Almost surely, 2110011211210011 is an apocalyptic number.
110011211210011 is a deficient number, since it is larger than the sum of its proper divisors (237605208261).
110011211210011 is an equidigital number, since it uses as much as digits as its factorization.
110011211210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237605208260.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110011211210011 its reverse (110012112110011), we get a palindrome (220023323320022).
The spelling of 110011211210011 in words is "one hundred ten trillion, eleven billion, two hundred eleven million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •