Base | Representation |
---|---|
bin | 1010001110011100001111… |
… | …0001110100100111101111 |
3 | 1110210211200220202121110012 |
4 | 2203213003301310213233 |
5 | 2433202100243000333 |
6 | 35525021120203435 |
7 | 2240203216301030 |
oct | 243470361644757 |
9 | 43724626677405 |
10 | 11243214031343 |
11 | 36452472354a8 |
12 | 131701576957b |
13 | 6372cc637a78 |
14 | 2ac262a22a87 |
15 | 1476dd885e48 |
hex | a39c3c749ef |
11243214031343 has 4 divisors (see below), whose sum is σ = 12849387464400. Its totient is φ = 9637040598288.
The previous prime is 11243214031337. The next prime is 11243214031363. The reversal of 11243214031343 is 34313041234211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11243214031343 - 218 = 11243213769199 is a prime.
It is a super-2 number, since 2×112432140313432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11243214031363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 803086716518 + ... + 803086716531.
It is an arithmetic number, because the mean of its divisors is an integer number (3212346866100).
Almost surely, 211243214031343 is an apocalyptic number.
11243214031343 is a deficient number, since it is larger than the sum of its proper divisors (1606173433057).
11243214031343 is an equidigital number, since it uses as much as digits as its factorization.
11243214031343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1606173433056.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 11243214031343 its reverse (34313041234211), we get a palindrome (45556255265554).
The spelling of 11243214031343 in words is "eleven trillion, two hundred forty-three billion, two hundred fourteen million, thirty-one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •