Base | Representation |
---|---|
bin | 110011101100101010… |
… | …0001001110001110001 |
3 | 101121120011221111120210 |
4 | 1213121110021301301 |
5 | 3304332122334301 |
6 | 123000230254333 |
7 | 11010116313513 |
oct | 1473124116161 |
9 | 347504844523 |
10 | 111020121201 |
11 | 430a0a67290 |
12 | 196244b73a9 |
13 | a613960712 |
14 | 553288bbb3 |
15 | 2d4b950ad6 |
hex | 19d9509c71 |
111020121201 has 16 divisors (see below), whose sum is σ = 161843486400. Its totient is φ = 67135057920.
The previous prime is 111020121167. The next prime is 111020121227. The reversal of 111020121201 is 102121020111.
It is not a de Polignac number, because 111020121201 - 217 = 111019990129 is a prime.
It is a super-2 number, since 2×1110201212012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (111020121601) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3731560 + ... + 3761193.
It is an arithmetic number, because the mean of its divisors is an integer number (10115217900).
Almost surely, 2111020121201 is an apocalyptic number.
111020121201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111020121201 is a deficient number, since it is larger than the sum of its proper divisors (50823365199).
111020121201 is a wasteful number, since it uses less digits than its factorization.
111020121201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7493216.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 111020121201 its reverse (102121020111), we get a palindrome (213141141312).
It can be divided in two parts, 111020 and 121201, that added together give a triangular number (232221 = T681).
The spelling of 111020121201 in words is "one hundred eleven billion, twenty million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •