Base | Representation |
---|---|
bin | 1010000111010010101110… |
… | …0111111111001111110111 |
3 | 1110101002200221200210210212 |
4 | 2201310223213333033313 |
5 | 2424144040432413221 |
6 | 35352350421140035 |
7 | 2225264635235561 |
oct | 241645347771767 |
9 | 43332627623725 |
10 | 11120402232311 |
11 | 35a8155174129 |
12 | 12b726025a61b |
13 | 628859a51ab8 |
14 | 2a63320a4331 |
15 | 144401b14b5b |
hex | a1d2b9ff3f7 |
11120402232311 has 8 divisors (see below), whose sum is σ = 11776284685584. Its totient is φ = 10464713239680.
The previous prime is 11120402232257. The next prime is 11120402232349. The reversal of 11120402232311 is 11323220402111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-11120402232311 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 (11120402232011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48246800 + ... + 48476741.
It is an arithmetic number, because the mean of its divisors is an integer number (1472035585698).
Almost surely, 211120402232311 is an apocalyptic number.
11120402232311 is a deficient number, since it is larger than the sum of its proper divisors (655882453273).
11120402232311 is an equidigital number, since it uses as much as digits as its factorization.
11120402232311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96730321.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 11120402232311 its reverse (11323220402111), we get a palindrome (22443622634422).
The spelling of 11120402232311 in words is "eleven trillion, one hundred twenty billion, four hundred two million, two hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •