Base | Representation |
---|---|
bin | 1010000110101111110101… |
… | …0000001010111111101001 |
3 | 1110100012112002021122220022 |
4 | 2201223331100022333221 |
5 | 2424020344240134231 |
6 | 35344201054010225 |
7 | 2224513534162643 |
oct | 241537520127751 |
9 | 43305462248808 |
10 | 11111034302441 |
11 | 35a4188221827 |
12 | 12b5486aa6975 |
13 | 6279c5cab528 |
14 | 2a5ac3c75893 |
15 | 1440544abc7b |
hex | a1afd40afe9 |
11111034302441 has 8 divisors (see below), whose sum is σ = 11141128247040. Its totient is φ = 11080941993072.
The previous prime is 11111034302351. The next prime is 11111034302443. The reversal of 11111034302441 is 14420343011111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11111034302441 - 218 = 11111034040297 is a prime.
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 11111034302441.
It is not an unprimeable number, because it can be changed into a prime (11111034302443) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13873646 + ... + 14652648.
It is an arithmetic number, because the mean of its divisors is an integer number (1392641030880).
Almost surely, 211111034302441 is an apocalyptic number.
It is an amenable number.
11111034302441 is a deficient number, since it is larger than the sum of its proper divisors (30093944599).
11111034302441 is an equidigital number, since it uses as much as digits as its factorization.
11111034302441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 817615.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 11111034302441 its reverse (14420343011111), we get a palindrome (25531377313552).
The spelling of 11111034302441 in words is "eleven trillion, one hundred eleven billion, thirty-four million, three hundred two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •