Base | Representation |
---|---|
bin | 110011101111000010… |
… | …0111100010110011001 |
3 | 101121202202021210022001 |
4 | 1213132010330112121 |
5 | 3310013101120441 |
6 | 123012203001001 |
7 | 11012106406126 |
oct | 1473604742631 |
9 | 347682253261 |
10 | 111100020121 |
11 | 43132079552 |
12 | 19647209161 |
13 | a627386a9c |
14 | 553d32974d |
15 | 2d53984731 |
hex | 19de13c599 |
111100020121 has 4 divisors (see below), whose sum is σ = 111663979812. Its totient is φ = 110536060432.
The previous prime is 111100020113. The next prime is 111100020179. The reversal of 111100020121 is 121020001111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 53900122896 + 57199897225 = 232164^2 + 239165^2 .
It is a cyclic number.
It is not a de Polignac number, because 111100020121 - 23 = 111100020113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111100020098 and 111100020107.
It is not an unprimeable number, because it can be changed into a prime (111100020721) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 281979550 + ... + 281979943.
It is an arithmetic number, because the mean of its divisors is an integer number (27915994953).
Almost surely, 2111100020121 is an apocalyptic number.
It is an amenable number.
111100020121 is a deficient number, since it is larger than the sum of its proper divisors (563959691).
111100020121 is an equidigital number, since it uses as much as digits as its factorization.
111100020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 563959690.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 111100020121 its reverse (121020001111), we get a palindrome (232120021232).
The spelling of 111100020121 in words is "one hundred eleven billion, one hundred million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •