Base | Representation |
---|---|
bin | 1010000111011101100001… |
… | …1110001011111101101000 |
3 | 1110101101012001100102200111 |
4 | 2201313120132023331220 |
5 | 2424221010320340240 |
6 | 35353550251544104 |
7 | 2225426540004514 |
oct | 241673036137550 |
9 | 43341161312614 |
10 | 11123302121320 |
11 | 35a9403077714 |
12 | 12b792b45b034 |
13 | 628bcc78415c |
14 | 2a652928b144 |
15 | 1445214d11ea |
hex | a1dd878bf68 |
11123302121320 has 32 divisors (see below), whose sum is σ = 25027561002600. Its totient is φ = 4449297518848.
The previous prime is 11123302121251. The next prime is 11123302121377. The reversal of 11123302121320 is 2312120332111.
It can be written as a sum of positive squares in 4 ways, for example, as 10529129399044 + 594172722276 = 3244862^2 + 770826^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11123302121291 and 11123302121300.
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, 8408922 + ... + 9641398.
Almost surely, 211123302121320 is an apocalyptic number.
11123302121320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11123302121320 is an abundant number, since it is smaller than the sum of its proper divisors (13904258881280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11123302121320 is a wasteful number, since it uses less digits than its factorization.
11123302121320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1458117 (or 1458113 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11123302121320 its reverse (2312120332111), we get a palindrome (13435422453431).
The spelling of 11123302121320 in words is "eleven trillion, one hundred twenty-three billion, three hundred two million, one hundred twenty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •