Base | Representation |
---|---|
bin | 1010010100010000011101… |
… | …0000001101110010101011 |
3 | 1111011101121020212222101101 |
4 | 2211010013100031302223 |
5 | 2441321212330220133 |
6 | 40042543453102231 |
7 | 2250341225605204 |
oct | 245040720156253 |
9 | 44141536788341 |
10 | 11343130320043 |
11 | 368365a395005 |
12 | 133245b487977 |
13 | 6438639b7aa2 |
14 | 2b30208d25ab |
15 | 14a0da58737d |
hex | a510740dcab |
11343130320043 has 16 divisors (see below), whose sum is σ = 11654367461856. Its totient is φ = 11033545615360.
The previous prime is 11343130320037. The next prime is 11343130320061. The reversal of 11343130320043 is 34002303134311.
It is a cyclic number.
It is not a de Polignac number, because 11343130320043 - 221 = 11343128222891 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11343130319993 and 11343130320020.
It is not an unprimeable number, because it can be changed into a prime (11343130327043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 184251555 + ... + 184313107.
It is an arithmetic number, because the mean of its divisors is an integer number (728397966366).
Almost surely, 211343130320043 is an apocalyptic number.
11343130320043 is a deficient number, since it is larger than the sum of its proper divisors (311237141813).
11343130320043 is a wasteful number, since it uses less digits than its factorization.
11343130320043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74894.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 11343130320043 its reverse (34002303134311), we get a palindrome (45345433454354).
The spelling of 11343130320043 in words is "eleven trillion, three hundred forty-three billion, one hundred thirty million, three hundred twenty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •