Base | Representation |
---|---|
bin | 110011110110110100… |
… | …0100010101100001001 |
3 | 101122102221101110201012 |
4 | 1213231220202230021 |
5 | 3311031404313231 |
6 | 123054124533305 |
7 | 11021425653632 |
oct | 1475550425411 |
9 | 348387343635 |
10 | 111361010441 |
11 | 4325642942a |
12 | 196ba6b1235 |
13 | a669476a25 |
14 | 5565c66889 |
15 | 2d6b839e2b |
hex | 19eda22b09 |
111361010441 has 4 divisors (see below), whose sum is σ = 117911658132. Its totient is φ = 104810362752.
The previous prime is 111361010413. The next prime is 111361010503. The reversal of 111361010441 is 144010163111.
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 74613654025 + 36747356416 = 273155^2 + 191696^2 .
It is not a de Polignac number, because 111361010441 - 214 = 111360994057 is a prime.
It is a super-2 number, since 2×1113610104412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111361010401) 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, 3275323820 + ... + 3275323853.
It is an arithmetic number, because the mean of its divisors is an integer number (29477914533).
Almost surely, 2111361010441 is an apocalyptic number.
It is an amenable number.
111361010441 is a deficient number, since it is larger than the sum of its proper divisors (6550647691).
111361010441 is an equidigital number, since it uses as much as digits as its factorization.
111361010441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6550647690.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 111361010441 its reverse (144010163111), we get a palindrome (255371173552).
The spelling of 111361010441 in words is "one hundred eleven billion, three hundred sixty-one million, ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •