Base | Representation |
---|---|
bin | 1010000001000100001000… |
… | …0111101011010001010001 |
3 | 1102222212112011101101002002 |
4 | 2200101002013223101101 |
5 | 2420420423244033231 |
6 | 35231253313003345 |
7 | 2214456311523644 |
oct | 240210207532121 |
9 | 42885464341062 |
10 | 11013405455441 |
11 | 3566839296004 |
12 | 129a57b253555 |
13 | 61b7377c74cc |
14 | 2a10a1ac5a5b |
15 | 14173d4eb0cb |
hex | a04421eb451 |
11013405455441 has 8 divisors (see below), whose sum is σ = 11077613239680. Its totient is φ = 10949227453552.
The previous prime is 11013405455431. The next prime is 11013405455527. The reversal of 11013405455441 is 14455450431011.
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-11013405455441 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11013405455395 and 11013405455404.
It is not an unprimeable number, because it can be changed into a prime (11013405455401) 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, 6703625 + ... + 8183238.
It is an arithmetic number, because the mean of its divisors is an integer number (1384701654960).
Almost surely, 211013405455441 is an apocalyptic number.
It is an amenable number.
11013405455441 is a deficient number, since it is larger than the sum of its proper divisors (64207784239).
11013405455441 is a wasteful number, since it uses less digits than its factorization.
11013405455441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14891175.
The product of its (nonzero) digits is 96000, while the sum is 38.
Adding to 11013405455441 its reverse (14455450431011), we get a palindrome (25468855886452).
The spelling of 11013405455441 in words is "eleven trillion, thirteen billion, four hundred five million, four hundred fifty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •