Base | Representation |
---|---|
bin | 1010001110011000111010… |
… | …0000111011011000010011 |
3 | 1110210202101122020221121021 |
4 | 2203212032200323120103 |
5 | 2433143233011111011 |
6 | 35524352314540311 |
7 | 2240142115530256 |
oct | 243461640733023 |
9 | 43722348227537 |
10 | 11242320410131 |
11 | 364492886a678 |
12 | 1316a06437697 |
13 | 6371b9465915 |
14 | 2ac1ba08709d |
15 | 14768a1b9471 |
hex | a398e83b613 |
11242320410131 has 32 divisors (see below), whose sum is σ = 12083925934080. Its totient is φ = 10435644979200.
The previous prime is 11242320410081. The next prime is 11242320410149. The reversal of 11242320410131 is 13101402324211.
It is a cyclic number.
It is not a de Polignac number, because 11242320410131 - 225 = 11242286855699 is a prime.
It is a super-2 number, since 2×112423204101312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11242320410096 and 11242320410105.
It is not an unprimeable number, because it can be changed into a prime (11242320410231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 274873075 + ... + 274913971.
It is an arithmetic number, because the mean of its divisors is an integer number (377622685440).
Almost surely, 211242320410131 is an apocalyptic number.
11242320410131 is a deficient number, since it is larger than the sum of its proper divisors (841605523949).
11242320410131 is a wasteful number, since it uses less digits than its factorization.
11242320410131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42955.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 11242320410131 its reverse (13101402324211), we get a palindrome (24343722734342).
The spelling of 11242320410131 in words is "eleven trillion, two hundred forty-two billion, three hundred twenty million, four hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •