Base | Representation |
---|---|
bin | 1010010100001101100001… |
… | …0110000001011111010011 |
3 | 1111011022120101222220011211 |
4 | 2211003120112001133103 |
5 | 2441313104342011423 |
6 | 40042333420520551 |
7 | 2250312561266116 |
oct | 245033026013723 |
9 | 44138511886154 |
10 | 11342343313363 |
11 | 3683296119267 |
12 | 133227b9b0157 |
13 | 64376993406a |
14 | 2b2d8818a57d |
15 | 14a09142a10d |
hex | a50d85817d3 |
11342343313363 has 4 divisors (see below), whose sum is σ = 11431653103360. Its totient is φ = 11253033523368.
The previous prime is 11342343313319. The next prime is 11342343313409. The reversal of 11342343313363 is 36331334324311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11342343313363 is a prime.
It is a super-4 number, since 4×113423433133634 (a number of 53 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11342343313303) 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, 44654894808 + ... + 44654895061.
It is an arithmetic number, because the mean of its divisors is an integer number (2857913275840).
Almost surely, 211342343313363 is an apocalyptic number.
11342343313363 is a deficient number, since it is larger than the sum of its proper divisors (89309789997).
11342343313363 is an equidigital number, since it uses as much as digits as its factorization.
11342343313363 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89309789996.
The product of its digits is 419904, while the sum is 40.
Adding to 11342343313363 its reverse (36331334324311), we get a palindrome (47673677637674).
The spelling of 11342343313363 in words is "eleven trillion, three hundred forty-two billion, three hundred forty-three million, three hundred thirteen thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •