Base | Representation |
---|---|
bin | 1010000111111101011100… |
… | …1010101101010001101100 |
3 | 1110102012022011122111222210 |
4 | 2201333113022231101230 |
5 | 2424341032231003033 |
6 | 35401524403010420 |
7 | 2226152056150056 |
oct | 241772712552154 |
9 | 43365264574883 |
10 | 11131870172268 |
11 | 3601aaa56115a |
12 | 12b9520969a10 |
13 | 6299668b79a1 |
14 | 2a6add1828d6 |
15 | 1448737d7d63 |
hex | a1fd72ad46c |
11131870172268 has 96 divisors (see below), whose sum is σ = 27510517149696. Its totient is φ = 3496025028672.
The previous prime is 11131870172243. The next prime is 11131870172303. The reversal of 11131870172268 is 86227107813111.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 361373755 + ... + 361404557.
It is an arithmetic number, because the mean of its divisors is an integer number (286567886976).
Almost surely, 211131870172268 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11131870172268, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13755258574848).
11131870172268 is an abundant number, since it is smaller than the sum of its proper divisors (16378646977428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11131870172268 is a wasteful number, since it uses less digits than its factorization.
11131870172268 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50443 (or 50441 counting only the distinct ones).
The product of its (nonzero) digits is 225792, while the sum is 48.
Adding to 11131870172268 its reverse (86227107813111), we get a palindrome (97358977985379).
The spelling of 11131870172268 in words is "eleven trillion, one hundred thirty-one billion, eight hundred seventy million, one hundred seventy-two thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •