Base | Representation |
---|---|
bin | 11001000010010100001000… |
… | …000001100101010000000010 |
3 | 112102212102200221100211102110 |
4 | 121002110020001211100002 |
5 | 103413021203031400002 |
6 | 1030103533244200150 |
7 | 32123125452332466 |
oct | 3102241001452002 |
9 | 472772627324373 |
10 | 110110211200002 |
11 | 320a2529722a62 |
12 | 1042411ab39056 |
13 | 495946b477480 |
14 | 1d295111c04a6 |
15 | cae345127e6c |
hex | 642508065402 |
110110211200002 has 16 divisors (see below), whose sum is σ = 237160454892480. Its totient is φ = 33880064984592.
The previous prime is 110110211199973. The next prime is 110110211200009. The reversal of 110110211200002 is 200002112011011.
It is a super-2 number, since 2×1101102112000022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110110211200009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 705834687102 + ... + 705834687257.
It is an arithmetic number, because the mean of its divisors is an integer number (14822528430780).
Almost surely, 2110110211200002 is an apocalyptic number.
110110211200002 is an abundant number, since it is smaller than the sum of its proper divisors (127050243692478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110211200002 is a wasteful number, since it uses less digits than its factorization.
110110211200002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1411669374377.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110110211200002 its reverse (200002112011011), we get a palindrome (310112323211013).
The spelling of 110110211200002 in words is "one hundred ten trillion, one hundred ten billion, two hundred eleven million, two hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •