Base | Representation |
---|---|
bin | 110011101100011010… |
… | …1001011010101001101 |
3 | 101121112121122221220100 |
4 | 1213120311023111031 |
5 | 3304323033013401 |
6 | 122555340241313 |
7 | 11006660303661 |
oct | 1473065132515 |
9 | 347477587810 |
10 | 111012001101 |
11 | 43097420561 |
12 | 19621840239 |
13 | a612079721 |
14 | 55317768a1 |
15 | 2d4ad99b86 |
hex | 19d8d4b54d |
111012001101 has 6 divisors (see below), whose sum is σ = 160350668270. Its totient is φ = 74008000728.
The previous prime is 111012001097. The next prime is 111012001109. The reversal of 111012001101 is 101100210111.
It can be written as a sum of positive squares in only one way, i.e., 72301832100 + 38710169001 = 268890^2 + 196749^2 .
It is not a de Polignac number, because 111012001101 - 22 = 111012001097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 12334666789 = 111012001101 / (1 + 1 + 1 + 0 + 1 + 2 + 0 + 0 + 1 + 1 + 0 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111012001109) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6167333386 + ... + 6167333403.
Almost surely, 2111012001101 is an apocalyptic number.
It is an amenable number.
111012001101 is a deficient number, since it is larger than the sum of its proper divisors (49338667169).
111012001101 is a wasteful number, since it uses less digits than its factorization.
111012001101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12334666795 (or 12334666792 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 111012001101 its reverse (101100210111), we get a palindrome (212112211212).
The spelling of 111012001101 in words is "one hundred eleven billion, twelve million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.288 sec. • engine limits •