Base | Representation |
---|---|
bin | 110011111100011100… |
… | …1100001011010101101 |
3 | 101122221010000200210212 |
4 | 1213320321201122231 |
5 | 3311423300323203 |
6 | 123124555512205 |
7 | 11026212310055 |
oct | 1477071413255 |
9 | 348833020725 |
10 | 111550011053 |
11 | 43343089388 |
12 | 19751a58665 |
13 | a69967c600 |
14 | 5582dc4565 |
15 | 2d7d2201d8 |
hex | 19f8e616ad |
111550011053 has 6 divisors (see below), whose sum is σ = 120790840554. Its totient is φ = 102969240816.
The previous prime is 111550011049. The next prime is 111550011059. The reversal of 111550011053 is 350110055111.
It can be written as a sum of positive squares in 3 ways, for example, as 5092677769 + 106457333284 = 71363^2 + 326278^2 .
It is not a de Polignac number, because 111550011053 - 22 = 111550011049 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111550011059) 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, 330029450 + ... + 330029787.
It is an arithmetic number, because the mean of its divisors is an integer number (20131806759).
Almost surely, 2111550011053 is an apocalyptic number.
111550011053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
111550011053 is a deficient number, since it is larger than the sum of its proper divisors (9240829501).
111550011053 is an equidigital number, since it uses as much as digits as its factorization.
111550011053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660059263 (or 660059250 counting only the distinct ones).
The product of its (nonzero) digits is 375, while the sum is 23.
Adding to 111550011053 its reverse (350110055111), we get a palindrome (461660066164).
The spelling of 111550011053 in words is "one hundred eleven billion, five hundred fifty million, eleven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •