Base | Representation |
---|---|
bin | 110011101101000011… |
… | …0111000100100010101 |
3 | 101121121002222011011212 |
4 | 1213122012320210111 |
5 | 3304344023420203 |
6 | 123001423311205 |
7 | 11010340332623 |
oct | 1473206704425 |
9 | 347532864155 |
10 | 111033420053 |
11 | 430a851a976 |
12 | 19628a4b505 |
13 | a61663896a |
14 | 5534550513 |
15 | 2d4cbcb1d8 |
hex | 19da1b8915 |
111033420053 has 4 divisors (see below), whose sum is σ = 111323324928. Its totient is φ = 110743515180.
The previous prime is 111033420049. The next prime is 111033420059. The reversal of 111033420053 is 350024330111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 350024330111 = 67 ⋅5224243733.
It is a cyclic number.
It is not a de Polignac number, because 111033420053 - 22 = 111033420049 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 (111033420059) 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, 144951863 + ... + 144952628.
It is an arithmetic number, because the mean of its divisors is an integer number (27830831232).
Almost surely, 2111033420053 is an apocalyptic number.
It is an amenable number.
111033420053 is a deficient number, since it is larger than the sum of its proper divisors (289904875).
111033420053 is an equidigital number, since it uses as much as digits as its factorization.
111033420053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289904874.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 111033420053 its reverse (350024330111), we get a palindrome (461057750164).
The spelling of 111033420053 in words is "one hundred eleven billion, thirty-three million, four hundred twenty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •