Base | Representation |
---|---|
bin | 11001000011111010011110… |
… | …000010100010000101111101 |
3 | 112110020221100102200202010102 |
4 | 121003322132002202011331 |
5 | 103421321232131322023 |
6 | 1030230225502050445 |
7 | 32134065611463521 |
oct | 3103723602420575 |
9 | 473227312622112 |
10 | 110220102214013 |
11 | 321350a02a4300 |
12 | 10441489279a25 |
13 | 496693220570c |
14 | 1d30977b13d81 |
15 | cb2127893628 |
hex | 643e9e0a217d |
110220102214013 has 48 divisors (see below), whose sum is σ = 126585652677120. Its totient is φ = 95716887298560.
The previous prime is 110220102213973. The next prime is 110220102214039. The reversal of 110220102214013 is 310412201022011.
It is a de Polignac number, because none of the positive numbers 2k-110220102214013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110220102214513) 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 47 ways as a sum of consecutive naturals, for example, 9005639948 + ... + 9005652186.
It is an arithmetic number, because the mean of its divisors is an integer number (2637201097440).
Almost surely, 2110220102214013 is an apocalyptic number.
It is an amenable number.
110220102214013 is a deficient number, since it is larger than the sum of its proper divisors (16365550463107).
110220102214013 is a wasteful number, since it uses less digits than its factorization.
110220102214013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16298 (or 16287 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 110220102214013 its reverse (310412201022011), we get a palindrome (420632303236024).
The spelling of 110220102214013 in words is "one hundred ten trillion, two hundred twenty billion, one hundred two million, two hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •