Base | Representation |
---|---|
bin | 11001000010100000001111… |
… | …011010101101110100101001 |
3 | 112102220200021112222000001211 |
4 | 121002200033122231310221 |
5 | 103413224323323143423 |
6 | 1030113524154513121 |
7 | 32124066024405400 |
oct | 3102401732556451 |
9 | 472820245860054 |
10 | 110123220131113 |
11 | 320a7aa49484a2 |
12 | 1042674b7357a1 |
13 | 495a762655347 |
14 | 1d29dc6bd2637 |
15 | cae85724110d |
hex | 64280f6add29 |
110123220131113 has 24 divisors (see below), whose sum is σ = 128822151444480. Its totient is φ = 93861453430080.
The previous prime is 110123220131101. The next prime is 110123220131131. The reversal of 110123220131113 is 311131022321011.
It is not a de Polignac number, because 110123220131113 - 213 = 110123220122921 is a prime.
It is a super-2 number, since 2×1101232201311132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110123220131213) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22407808 + ... + 26876686.
It is an arithmetic number, because the mean of its divisors is an integer number (5367589643520).
Almost surely, 2110123220131113 is an apocalyptic number.
It is an amenable number.
110123220131113 is a deficient number, since it is larger than the sum of its proper divisors (18698931313367).
110123220131113 is a wasteful number, since it uses less digits than its factorization.
110123220131113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4471717 (or 4471710 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 110123220131113 its reverse (311131022321011), we get a palindrome (421254242452124).
The spelling of 110123220131113 in words is "one hundred ten trillion, one hundred twenty-three billion, two hundred twenty million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •