Base | Representation |
---|---|
bin | 10100101100110001… |
… | …11001010110001101 |
3 | 1001200111011002112211 |
4 | 22112120321112031 |
5 | 140224414341331 |
6 | 5034423030421 |
7 | 542251211161 |
oct | 122630712615 |
9 | 31614132484 |
10 | 11113043341 |
11 | 4793028a44 |
12 | 21a189b411 |
13 | 1081486cba |
14 | 775cd8ca1 |
15 | 45096d8b1 |
hex | 29663958d |
11113043341 has 8 divisors (see below), whose sum is σ = 11133678080. Its totient is φ = 11092429008.
The previous prime is 11113043303. The next prime is 11113043369. The reversal of 11113043341 is 14334031111.
11113043341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11113043341 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 (11113043371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1436215 + ... + 1443931.
It is an arithmetic number, because the mean of its divisors is an integer number (1391709760).
Almost surely, 211113043341 is an apocalyptic number.
It is an amenable number.
11113043341 is a deficient number, since it is larger than the sum of its proper divisors (20634739).
11113043341 is an equidigital number, since it uses as much as digits as its factorization.
11113043341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10203.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11113043341 its reverse (14334031111), we get a palindrome (25447074452).
The spelling of 11113043341 in words is "eleven billion, one hundred thirteen million, forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •