Base | Representation |
---|---|
bin | 110011110000011001… |
… | …0011100101001100011 |
3 | 101121212220212120112101 |
4 | 1213200302130221203 |
5 | 3310111222101311 |
6 | 123020505511231 |
7 | 11013201122212 |
oct | 1474062345143 |
9 | 347786776471 |
10 | 111145503331 |
11 | 43155814785 |
12 | 1965a4a2517 |
13 | a633920325 |
14 | 55453a9079 |
15 | 2d5796aec1 |
hex | 19e0c9ca63 |
111145503331 has 4 divisors (see below), whose sum is σ = 111265144200. Its totient is φ = 111025862464.
The previous prime is 111145503281. The next prime is 111145503349. The reversal of 111145503331 is 133305541111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 133305541111 = 26423 ⋅5045057.
It is a cyclic number.
It is not a de Polignac number, because 111145503331 - 223 = 111137114723 is a prime.
It is a super-2 number, since 2×1111455033312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 111145503331.
It is not an unprimeable number, because it can be changed into a prime (111145303331) 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, 59819041 + ... + 59820898.
It is an arithmetic number, because the mean of its divisors is an integer number (27816286050).
Almost surely, 2111145503331 is an apocalyptic number.
111145503331 is a deficient number, since it is larger than the sum of its proper divisors (119640869).
111145503331 is an equidigital number, since it uses as much as digits as its factorization.
111145503331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119640868.
The product of its (nonzero) digits is 2700, while the sum is 28.
The spelling of 111145503331 in words is "one hundred eleven billion, one hundred forty-five million, five hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •