Base | Representation |
---|---|
bin | 1010010001111011110000… |
… | …0000001110100101011011 |
3 | 1111000120120100122201200222 |
4 | 2210132330000032211123 |
5 | 2440142440030211443 |
6 | 40012342513150255 |
7 | 2244426105242063 |
oct | 244367400164533 |
9 | 44016510581628 |
10 | 11303213132123 |
11 | 3668736158a00 |
12 | 132677b25b38b |
13 | 63cb71b3b873 |
14 | 2b11153203a3 |
15 | 149050eac468 |
hex | a47bc00e95b |
11303213132123 has 24 divisors (see below), whose sum is σ = 12544355392800. Its totient is φ = 10176358769280.
The previous prime is 11303213132041. The next prime is 11303213132153. The reversal of 11303213132123 is 32123131230311.
It is not a de Polignac number, because 11303213132123 - 210 = 11303213131099 is a prime.
It is a super-2 number, since 2×113032131321232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11303213132092 and 11303213132101.
It is not an unprimeable number, because it can be changed into a prime (11303213132153) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26682215 + ... + 27102527.
It is an arithmetic number, because the mean of its divisors is an integer number (522681474700).
Almost surely, 211303213132123 is an apocalyptic number.
11303213132123 is a deficient number, since it is larger than the sum of its proper divisors (1241142260677).
11303213132123 is a wasteful number, since it uses less digits than its factorization.
11303213132123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422483 (or 422472 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 11303213132123 its reverse (32123131230311), we get a palindrome (43426344362434).
The spelling of 11303213132123 in words is "eleven trillion, three hundred three billion, two hundred thirteen million, one hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •