Base | Representation |
---|---|
bin | 11001000011100111111100… |
… | …011000100100010010101011 |
3 | 112110012001000010101100021112 |
4 | 121003213330120210102223 |
5 | 103421010012303241021 |
6 | 1030213135551300535 |
7 | 32132462640322553 |
oct | 3103477430442253 |
9 | 473161003340245 |
10 | 110200210212011 |
11 | 32127712829827 |
12 | 1043965751a74b |
13 | 4964ab2011b2a |
14 | 1d2da0bd02163 |
15 | cb186135bd5b |
hex | 6439fc6244ab |
110200210212011 has 8 divisors (see below), whose sum is σ = 112899555114864. Its totient is φ = 107501414590080.
The previous prime is 110200210211989. The next prime is 110200210212101. The reversal of 110200210212011 is 110212012002011.
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 110200210212011 - 214 = 110200210195627 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110200210212511) 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 7 ways as a sum of consecutive naturals, for example, 136914050 + ... + 137716583.
It is an arithmetic number, because the mean of its divisors is an integer number (14112444389358).
Almost surely, 2110200210212011 is an apocalyptic number.
110200210212011 is a deficient number, since it is larger than the sum of its proper divisors (2699344902853).
110200210212011 is an equidigital number, since it uses as much as digits as its factorization.
110200210212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274640461.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110200210212011 its reverse (110212012002011), we get a palindrome (220412222214022).
The spelling of 110200210212011 in words is "one hundred ten trillion, two hundred billion, two hundred ten million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •