Base | Representation |
---|---|
bin | 1010001100101100110101… |
… | …1011101001101001101010 |
3 | 1110200222111221100102022012 |
4 | 2203023031123221221222 |
5 | 2432204330133022310 |
6 | 35503153555155522 |
7 | 2235064206506012 |
oct | 243131533515152 |
9 | 43628457312265 |
10 | 11213311220330 |
11 | 36335a1942a4a |
12 | 131126b2a5ba2 |
13 | 634545440b5b |
14 | 2aaa27476c42 |
15 | 146a3d558c05 |
hex | a32cd6e9a6a |
11213311220330 has 8 divisors (see below), whose sum is σ = 20183960196612. Its totient is φ = 4485324488128.
The previous prime is 11213311220317. The next prime is 11213311220369. The reversal of 11213311220330 is 3302211331211.
It can be written as a sum of positive squares in 2 ways, for example, as 9203815020841 + 2009496199489 = 3033779^2 + 1417567^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11213311220296 and 11213311220305.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 560665561007 + ... + 560665561026.
Almost surely, 211213311220330 is an apocalyptic number.
11213311220330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11213311220330 is a deficient number, since it is larger than the sum of its proper divisors (8970648976282).
11213311220330 is a wasteful number, since it uses less digits than its factorization.
11213311220330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1121331122040.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11213311220330 its reverse (3302211331211), we get a palindrome (14515522551541).
The spelling of 11213311220330 in words is "eleven trillion, two hundred thirteen billion, three hundred eleven million, two hundred twenty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •