Base | Representation |
---|---|
bin | 1010000110110011011101… |
… | …1011000000011001000011 |
3 | 1110100022001002122110122200 |
4 | 2201230313123000121003 |
5 | 2424024344104033443 |
6 | 35344441555204243 |
7 | 2224546654305630 |
oct | 241546733003103 |
9 | 43308032573580 |
10 | 11112010221123 |
11 | 35a4639097999 |
12 | 12b56b98a6683 |
13 | 627b202366c6 |
14 | 2a5b77715187 |
15 | 1440aeed2dd3 |
hex | a1b376c0643 |
11112010221123 has 96 divisors (see below), whose sum is σ = 19628986291200. Its totient is φ = 5916279398400.
The previous prime is 11112010221121. The next prime is 11112010221197. The reversal of 11112010221123 is 32112201021111.
It is a happy number.
It is not a de Polignac number, because 11112010221123 - 21 = 11112010221121 is a prime.
It is a super-2 number, since 2×111120102211232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11112010221096 and 11112010221105.
It is not an unprimeable number, because it can be changed into a prime (11112010221121) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 34599843 + ... + 34919523.
It is an arithmetic number, because the mean of its divisors is an integer number (204468607200).
Almost surely, 211112010221123 is an apocalyptic number.
11112010221123 is a deficient number, since it is larger than the sum of its proper divisors (8516976070077).
11112010221123 is a wasteful number, since it uses less digits than its factorization.
11112010221123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320193 (or 320190 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 11112010221123 its reverse (32112201021111), we get a palindrome (43224211242234).
The spelling of 11112010221123 in words is "eleven trillion, one hundred twelve billion, ten million, two hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •