Base | Representation |
---|---|
bin | 1010000111011101010001… |
… | …0110111001100100101000 |
3 | 1110101101000020110220010211 |
4 | 2201313110112321210220 |
5 | 2424220340133231440 |
6 | 35353535344350504 |
7 | 2225425041234406 |
oct | 241672426714450 |
9 | 43341006426124 |
10 | 11123233102120 |
11 | 35a9378116557 |
12 | 12b7910315434 |
13 | 628bbb399ba9 |
14 | 2a6520042476 |
15 | 14451a3eaeea |
hex | a1dd45b9928 |
11123233102120 has 64 divisors (see below), whose sum is σ = 25051221896400. Its totient is φ = 4445037527040.
The previous prime is 11123233102117. The next prime is 11123233102139. The reversal of 11123233102120 is 2120133232111.
It can be written as a sum of positive squares in 8 ways, for example, as 1172148344964 + 9951084757156 = 1082658^2 + 3154534^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11123233102091 and 11123233102100.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 251174380 + ... + 251218660.
Almost surely, 211123233102120 is an apocalyptic number.
11123233102120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11123233102120 is an abundant number, since it is smaller than the sum of its proper divisors (13927988794280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11123233102120 is a wasteful number, since it uses less digits than its factorization.
11123233102120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50158 (or 50154 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11123233102120 its reverse (2120133232111), we get a palindrome (13243366334231).
The spelling of 11123233102120 in words is "eleven trillion, one hundred twenty-three billion, two hundred thirty-three million, one hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •