Base | Representation |
---|---|
bin | 1010001000000010110110… |
… | …1001111100111000101011 |
3 | 1110102100001022000112021202 |
4 | 2202000231221330320223 |
5 | 2424402020212000433 |
6 | 35402324355354415 |
7 | 2226233035543061 |
oct | 242005551747053 |
9 | 43370038015252 |
10 | 11133321203243 |
11 | 3602684635208 |
12 | 12b98668b2a0b |
13 | 629b383c2bb5 |
14 | 2a6bd9b7a031 |
15 | 14490adacee8 |
hex | a202da7ce2b |
11133321203243 has 8 divisors (see below), whose sum is σ = 11687248066560. Its totient is φ = 10591568556840.
The previous prime is 11133321203161. The next prime is 11133321203281. The reversal of 11133321203243 is 34230212333111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11133321203243 - 216 = 11133321137707 is a prime.
It is a super-2 number, since 2×111333212032432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11133321203293) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3043552355 + ... + 3043556012.
It is an arithmetic number, because the mean of its divisors is an integer number (1460906008320).
Almost surely, 211133321203243 is an apocalyptic number.
11133321203243 is a deficient number, since it is larger than the sum of its proper divisors (553926863317).
11133321203243 is an equidigital number, since it uses as much as digits as its factorization.
11133321203243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6087108457.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 11133321203243 its reverse (34230212333111), we get a palindrome (45363533536354).
The spelling of 11133321203243 in words is "eleven trillion, one hundred thirty-three billion, three hundred twenty-one million, two hundred three thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •