Base | Representation |
---|---|
bin | 11001000000111010100111… |
… | …011011110101000011011011 |
3 | 112102112020121212211122001221 |
4 | 121000322213123311003123 |
5 | 103404432334430110021 |
6 | 1025551440325552511 |
7 | 32113153663522231 |
oct | 3100724733650333 |
9 | 472466555748057 |
10 | 110014101410011 |
11 | 3206579a203257 |
12 | 10409577b75737 |
13 | 49503928c8856 |
14 | 1d249d4a94951 |
15 | cababc6c8241 |
hex | 640ea76f50db |
110014101410011 has 8 divisors (see below), whose sum is σ = 110213775000000. Its totient is φ = 109814572463040.
The previous prime is 110014101409999. The next prime is 110014101410029.
110014101410011 is nontrivially palindromic in base 10.
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 110014101410011 - 223 = 110014093021403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110014101440011) 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, 34638136 + ... + 37680613.
It is an arithmetic number, because the mean of its divisors is an integer number (13776721875000).
Almost surely, 2110014101410011 is an apocalyptic number.
110014101410011 is a deficient number, since it is larger than the sum of its proper divisors (199673589989).
110014101410011 is an equidigital number, since it uses as much as digits as its factorization.
110014101410011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72321509.
The product of its (nonzero) digits is 16, while the sum is 16.
It can be divided in two parts, 11001410 and 1410011, that added together give a palindrome (12411421).
The spelling of 110014101410011 in words is "one hundred ten trillion, fourteen billion, one hundred one million, four hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •