Base | Representation |
---|---|
bin | 11001000011100111110000… |
… | …100100100001110100010011 |
3 | 112110012000111022110012100010 |
4 | 121003213300210201310103 |
5 | 103421004111034133021 |
6 | 1030213104151330003 |
7 | 32132455012611333 |
oct | 3103476044416423 |
9 | 473160438405303 |
10 | 110200012021011 |
11 | 32127620971a10 |
12 | 10439601080903 |
13 | 4964a7cc3c053 |
14 | 1d2d9cd8710c3 |
15 | cb184dc5d976 |
hex | 6439f0921d13 |
110200012021011 has 8 divisors (see below), whose sum is σ = 160290926576064. Its totient is φ = 66787886073320.
The previous prime is 110200012020949. The next prime is 110200012021013. The reversal of 110200012021011 is 110120210002011.
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 110200012021011 - 215 = 110200011988243 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110200012021013) 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, 1669697151801 + ... + 1669697151866.
It is an arithmetic number, because the mean of its divisors is an integer number (20036365822008).
Almost surely, 2110200012021011 is an apocalyptic number.
110200012021011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110200012021011 is a deficient number, since it is larger than the sum of its proper divisors (50090914555053).
110200012021011 is a wasteful number, since it uses less digits than its factorization.
110200012021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3339394303681.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110200012021011 its reverse (110120210002011), we get a palindrome (220320222023022).
The spelling of 110200012021011 in words is "one hundred ten trillion, two hundred billion, twelve million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •