Base | Representation |
---|---|
bin | 1010000000010110011000… |
… | …0110100010001110010011 |
3 | 1102221200211021002200121120 |
4 | 2200011212012202032103 |
5 | 2420220300300443011 |
6 | 35221502515453323 |
7 | 2213543054052003 |
oct | 240054606421623 |
9 | 42850737080546 |
10 | 11001124234131 |
11 | 3561606916729 |
12 | 12981122b7243 |
13 | 61a52b30b455 |
14 | 2a06589c2003 |
15 | 14127022aa06 |
hex | a01661a2393 |
11001124234131 has 8 divisors (see below), whose sum is σ = 14732783116224. Its totient is φ = 7301774087400.
The previous prime is 11001124234117. The next prime is 11001124234171. The reversal of 11001124234131 is 13143242110011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11001124234131 - 27 = 11001124234003 is a prime.
It is a super-2 number, since 2×110011242341312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11001124234171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8077183045 + ... + 8077184406.
It is an arithmetic number, because the mean of its divisors is an integer number (1841597889528).
Almost surely, 211001124234131 is an apocalyptic number.
11001124234131 is a deficient number, since it is larger than the sum of its proper divisors (3731658882093).
11001124234131 is a wasteful number, since it uses less digits than its factorization.
11001124234131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16154367681.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 11001124234131 its reverse (13143242110011), we get a palindrome (24144366344142).
The spelling of 11001124234131 in words is "eleven trillion, one billion, one hundred twenty-four million, two hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •