Base | Representation |
---|---|
bin | 11001000011100111110111… |
… | …001000000100101001011011 |
3 | 112110012000202222101210220111 |
4 | 121003213313020010221123 |
5 | 103421004322213031021 |
6 | 1030213123120505151 |
7 | 32132460516463546 |
oct | 3103476710045133 |
9 | 473160688353814 |
10 | 110200122002011 |
11 | 32127677a602a8 |
12 | 10439631a7b1b7 |
13 | 4964a99968872 |
14 | 1d2da002dd85d |
15 | cb18587358e1 |
hex | 6439f7204a5b |
110200122002011 has 16 divisors (see below), whose sum is σ = 110546898184800. Its totient is φ = 109853657222400.
The previous prime is 110200122001999. The next prime is 110200122002051. The reversal of 110200122002011 is 110200221002011.
It is a cyclic number.
It is not a de Polignac number, because 110200122002011 - 245 = 75015749913179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110200122001982 and 110200122002000.
It is not an unprimeable number, because it can be changed into a prime (110200122002051) 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 15 ways as a sum of consecutive naturals, for example, 10120310655 + ... + 10120321543.
It is an arithmetic number, because the mean of its divisors is an integer number (6909181136550).
Almost surely, 2110200122002011 is an apocalyptic number.
110200122002011 is a deficient number, since it is larger than the sum of its proper divisors (346776182789).
110200122002011 is a wasteful number, since it uses less digits than its factorization.
110200122002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22350.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110200122002011 its reverse (110200221002011), we get a palindrome (220400343004022).
The spelling of 110200122002011 in words is "one hundred ten trillion, two hundred billion, one hundred twenty-two million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •