Base | Representation |
---|---|
bin | 1010000111011110011001… |
… | …0111110001001111110100 |
3 | 1110101101210022011011012120 |
4 | 2201313212113301033310 |
5 | 2424222000020220202 |
6 | 35354025342115540 |
7 | 2225435401112301 |
oct | 241674627611764 |
9 | 43341708134176 |
10 | 11123535320052 |
11 | 35a9512775341 |
12 | 12b799557bbb0 |
13 | 628c38b9337c |
14 | 2a654c2320a8 |
15 | 144536be70bc |
hex | a1de65f13f4 |
11123535320052 has 24 divisors (see below), whose sum is σ = 26006929620000. Its totient is φ = 3700414553376.
The previous prime is 11123535319997. The next prime is 11123535320081. The reversal of 11123535320052 is 25002353532111.
It is a junction number, because it is equal to n+sod(n) for n = 11123535319995 and 11123535320022.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 928812927 + ... + 928824902.
It is an arithmetic number, because the mean of its divisors is an integer number (1083622067500).
Almost surely, 211123535320052 is an apocalyptic number.
11123535320052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11123535320052 is an abundant number, since it is smaller than the sum of its proper divisors (14883394299948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11123535320052 is a wasteful number, since it uses less digits than its factorization.
11123535320052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1857638335 (or 1857638333 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 11123535320052 its reverse (25002353532111), we get a palindrome (36125888852163).
The spelling of 11123535320052 in words is "eleven trillion, one hundred twenty-three billion, five hundred thirty-five million, three hundred twenty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •