Base | Representation |
---|---|
bin | 1010001101110010110101… |
… | …1001011100010000111011 |
3 | 1110202210000102212101021011 |
4 | 2203130231121130100323 |
5 | 2433011320341420011 |
6 | 35515542300054351 |
7 | 2236330636161520 |
oct | 243345531342073 |
9 | 43683012771234 |
10 | 11232101123131 |
11 | 364056429a039 |
12 | 1314a33b343b7 |
13 | 63624b1ca435 |
14 | 2ab8cab61147 |
15 | 14728ce42621 |
hex | a372d65c43b |
11232101123131 has 32 divisors (see below), whose sum is σ = 13045709232000. Its totient is φ = 9471435079680.
The previous prime is 11232101123069. The next prime is 11232101123143. The reversal of 11232101123131 is 13132110123211.
It is not a de Polignac number, because 11232101123131 - 219 = 11232100598843 is a prime.
It is a super-2 number, since 2×112321011231312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11232101126131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 977633835 + ... + 977645323.
It is an arithmetic number, because the mean of its divisors is an integer number (407678413500).
Almost surely, 211232101123131 is an apocalyptic number.
11232101123131 is a deficient number, since it is larger than the sum of its proper divisors (1813608108869).
11232101123131 is a wasteful number, since it uses less digits than its factorization.
11232101123131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16279.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 11232101123131 its reverse (13132110123211), we get a palindrome (24364211246342).
The spelling of 11232101123131 in words is "eleven trillion, two hundred thirty-two billion, one hundred one million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •