Base | Representation |
---|---|
bin | 11001000011100111111100… |
… | …111101111010001011110011 |
3 | 112110012001000210210200021002 |
4 | 121003213330331322023303 |
5 | 103421010022310013021 |
6 | 1030213140541152215 |
7 | 32132463116453120 |
oct | 3103477475721363 |
9 | 473161023720232 |
10 | 110200220001011 |
11 | 32127718305408 |
12 | 1043965a85b66b |
13 | 4964ab405b63a |
14 | 1d2da0d32d747 |
15 | cb186214250b |
hex | 6439fcf7a2f3 |
110200220001011 has 16 divisors (see below), whose sum is σ = 128872997941248. Its totient is φ = 92259947808000.
The previous prime is 110200220000999. The next prime is 110200220001041. The reversal of 110200220001011 is 110100022002011.
It is not a de Polignac number, because 110200220001011 - 218 = 110200219738867 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110200220000983 and 110200220001001.
It is not an unprimeable number, because it can be changed into a prime (110200220001041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40336046 + ... + 42981356.
It is an arithmetic number, because the mean of its divisors is an integer number (8054562371328).
Almost surely, 2110200220001011 is an apocalyptic number.
110200220001011 is a deficient number, since it is larger than the sum of its proper divisors (18672777940237).
110200220001011 is a wasteful number, since it uses less digits than its factorization.
110200220001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2783762.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110200220001011 its reverse (110100022002011), we get a palindrome (220300242003022).
The spelling of 110200220001011 in words is "one hundred ten trillion, two hundred billion, two hundred twenty million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •