Base | Representation |
---|---|
bin | 1010010010100000101001… |
… | …1111111011100011100000 |
3 | 1111001112010210011202212202 |
4 | 2210220022133323203200 |
5 | 2440323232210001344 |
6 | 40021101531512332 |
7 | 2245226442235340 |
oct | 244501237734340 |
9 | 44045123152782 |
10 | 11313120000224 |
11 | 367195a3425a9 |
12 | 1328684bb86a8 |
13 | 640a9044b6b3 |
14 | 2b17b4d5cd20 |
15 | 149430ac094e |
hex | a4a0a7fb8e0 |
11313120000224 has 48 divisors (see below), whose sum is σ = 26951844715488. Its totient is φ = 4563275292672.
The previous prime is 11313120000209. The next prime is 11313120000251. The reversal of 11313120000224 is 42200002131311.
It is a junction number, because it is equal to n+sod(n) for n = 11313120000196 and 11313120000205.
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, 1485437369 + ... + 1485444984.
It is an arithmetic number, because the mean of its divisors is an integer number (561496764906).
Almost surely, 211313120000224 is an apocalyptic number.
11313120000224 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11313120000224 is an abundant number, since it is smaller than the sum of its proper divisors (15638724715264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11313120000224 is a wasteful number, since it uses less digits than its factorization.
11313120000224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2970882387 (or 2970882379 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11313120000224 its reverse (42200002131311), we get a palindrome (53513122131535).
The spelling of 11313120000224 in words is "eleven trillion, three hundred thirteen billion, one hundred twenty million, two hundred twenty-four", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •