Base | Representation |
---|---|
bin | 1010010010100000101100… |
… | …0110111000101100010000 |
3 | 1111001112011111101120221211 |
4 | 2210220023012320230100 |
5 | 2440323242313241422 |
6 | 40021102534425504 |
7 | 2245226625106531 |
oct | 244501306705420 |
9 | 44045144346854 |
10 | 11313130212112 |
11 | 3671965087983 |
12 | 1328688502294 |
13 | 640a925b5831 |
14 | 2b17b645a688 |
15 | 14943193b577 |
hex | a4a0b1b8b10 |
11313130212112 has 20 divisors (see below), whose sum is σ = 22165472820060. Its totient is φ = 5593008194048.
The previous prime is 11313130212103. The next prime is 11313130212151. The reversal of 11313130212112 is 21121203131311.
It can be written as a sum of positive squares in 2 ways, for example, as 8099055741456 + 3214074470656 = 2845884^2 + 1792784^2 .
It is a super-2 number, since 2×113131302121122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3972305533 + ... + 3972308380.
It is an arithmetic number, because the mean of its divisors is an integer number (1108273641003).
Almost surely, 211313130212112 is an apocalyptic number.
It is an amenable number.
11313130212112 is a deficient number, since it is larger than the sum of its proper divisors (10852342607948).
11313130212112 is an equidigital number, since it uses as much as digits as its factorization.
11313130212112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7944614010 (or 7944614004 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 11313130212112 its reverse (21121203131311), we get a palindrome (32434333343423).
The spelling of 11313130212112 in words is "eleven trillion, three hundred thirteen billion, one hundred thirty million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •