Base | Representation |
---|---|
bin | 11001000110101101100100… |
… | …001000011100100011111011 |
3 | 112110221022201021211111211122 |
4 | 121012231210020130203323 |
5 | 103432444100434322021 |
6 | 1030454431441215455 |
7 | 32154014206510034 |
oct | 3106554410344373 |
9 | 473838637744748 |
10 | 110412404214011 |
11 | 321a9701808129 |
12 | 104727b693158b |
13 | 497baca72c9b3 |
14 | 1d39dbb6a1a8b |
15 | cb71300c3bab |
hex | 646b6421c8fb |
110412404214011 has 4 divisors (see below), whose sum is σ = 110412635812032. Its totient is φ = 110412172615992.
The previous prime is 110412404214001. The next prime is 110412404214043.
110412404214011 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110412404214011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110412404214001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 115082420 + ... + 116037873.
It is an arithmetic number, because the mean of its divisors is an integer number (27603158953008).
Almost surely, 2110412404214011 is an apocalyptic number.
110412404214011 is a deficient number, since it is larger than the sum of its proper divisors (231598021).
110412404214011 is an equidigital number, since it uses as much as digits as its factorization.
110412404214011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231598020.
The product of its (nonzero) digits is 1024, while the sum is 26.
It can be divided in two parts, 11041240 and 4214011, that added together give a palindrome (15255251).
The spelling of 110412404214011 in words is "one hundred ten trillion, four hundred twelve billion, four hundred four million, two hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •