Base | Representation |
---|---|
bin | 1010000111111111000111… |
… | …1111000011001110111111 |
3 | 1110102020110112021021121102 |
4 | 2201333301333003032333 |
5 | 2424342442421220221 |
6 | 35402041154323315 |
7 | 2226166161402413 |
oct | 241776177031677 |
9 | 43366415237542 |
10 | 11132320101311 |
11 | 3602210529542 |
12 | 12b962758953b |
13 | 629a08b8b2a6 |
14 | 2a6b42c22d43 |
15 | 14489d06030b |
hex | a1ff1fc33bf |
11132320101311 has 8 divisors (see below), whose sum is σ = 11404563763824. Its totient is φ = 10860110898880.
The previous prime is 11132320101241. The next prime is 11132320101389. The reversal of 11132320101311 is 11310102323111.
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 11132320101311 - 230 = 11131246359487 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 (11132320121311) 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, 7960421 + ... + 9253806.
It is an arithmetic number, because the mean of its divisors is an integer number (1425570470478).
Almost surely, 211132320101311 is an apocalyptic number.
11132320101311 is a deficient number, since it is larger than the sum of its proper divisors (272243662513).
11132320101311 is a wasteful number, since it uses less digits than its factorization.
11132320101311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17230041.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11132320101311 its reverse (11310102323111), we get a palindrome (22442422424422).
The spelling of 11132320101311 in words is "eleven trillion, one hundred thirty-two billion, three hundred twenty million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •