Base | Representation |
---|---|
bin | 1010000010101011000010… |
… | …1011011111000110010111 |
3 | 1110002111211101002202122202 |
4 | 2200222300223133012113 |
5 | 2421344012203442221 |
6 | 35252102413515115 |
7 | 2216455006466543 |
oct | 240526053370627 |
9 | 43074741082582 |
10 | 11041030140311 |
11 | 3577524747686 |
12 | 12a39aa7a2a9b |
13 | 62121aa375a2 |
14 | 2a2562898a23 |
15 | 142308827d0b |
hex | a0ab0adf197 |
11041030140311 has 4 divisors (see below), whose sum is σ = 11144217337992. Its totient is φ = 10937842942632.
The previous prime is 11041030140299. The next prime is 11041030140389. The reversal of 11041030140311 is 11304103014011.
11041030140311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11041030140311 - 210 = 11041030139287 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 (11041030140211) 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, 51593598680 + ... + 51593598893.
It is an arithmetic number, because the mean of its divisors is an integer number (2786054334498).
Almost surely, 211041030140311 is an apocalyptic number.
11041030140311 is a deficient number, since it is larger than the sum of its proper divisors (103187197681).
11041030140311 is a wasteful number, since it uses less digits than its factorization.
11041030140311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103187197680.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11041030140311 its reverse (11304103014011), we get a palindrome (22345133154322).
The spelling of 11041030140311 in words is "eleven trillion, forty-one billion, thirty million, one hundred forty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •