Base | Representation |
---|---|
bin | 1010000111111111100011… |
… | …1111101100010011110111 |
3 | 1110102020202201120102111102 |
4 | 2201333320333230103313 |
5 | 2424343213023210241 |
6 | 35402100555200315 |
7 | 2226202120144166 |
oct | 241777077542367 |
9 | 43366681512442 |
10 | 11132437710071 |
11 | 3602270957767 |
12 | 12b965aa4609b |
13 | 629a27358982 |
14 | 2a6b546b93dd |
15 | 1448a854239b |
hex | a1ff8fec4f7 |
11132437710071 has 8 divisors (see below), whose sum is σ = 11805337974384. Its totient is φ = 10461543111040.
The previous prime is 11132437710059. The next prime is 11132437710073. The reversal of 11132437710071 is 17001773423111.
It is a happy number.
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-11132437710071 is a prime.
It is a super-2 number, since 2×111324377100712 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11132437710073) 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, 501404885 + ... + 501427086.
It is an arithmetic number, because the mean of its divisors is an integer number (1475667246798).
Almost surely, 211132437710071 is an apocalyptic number.
11132437710071 is a deficient number, since it is larger than the sum of its proper divisors (672900264313).
11132437710071 is a wasteful number, since it uses less digits than its factorization.
11132437710071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1002832641.
The product of its (nonzero) digits is 24696, while the sum is 38.
The spelling of 11132437710071 in words is "eleven trillion, one hundred thirty-two billion, four hundred thirty-seven million, seven hundred ten thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •