Base | Representation |
---|---|
bin | 1010001000000010011010… |
… | …0000101110011101000011 |
3 | 1110102022201221111001202111 |
4 | 2202000212200232131003 |
5 | 2424401244021004243 |
6 | 35402304434400151 |
7 | 2226230052010132 |
oct | 242004640563503 |
9 | 43368657431674 |
10 | 11133201344323 |
11 | 3602622a0a453 |
12 | 12b9832730057 |
13 | 629b19618266 |
14 | 2a6bc7c99919 |
15 | 1449005d439d |
hex | a202682e743 |
11133201344323 has 8 divisors (see below), whose sum is σ = 11405042199936. Its totient is φ = 10861374744000.
The previous prime is 11133201344269. The next prime is 11133201344333. The reversal of 11133201344323 is 32344310233111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11133201344323 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11133201344333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1974228 + ... + 5115073.
It is an arithmetic number, because the mean of its divisors is an integer number (1425630274992).
Almost surely, 211133201344323 is an apocalyptic number.
11133201344323 is a deficient number, since it is larger than the sum of its proper divisors (271840855613).
11133201344323 is an equidigital number, since it uses as much as digits as its factorization.
11133201344323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7127645.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 11133201344323 its reverse (32344310233111), we get a palindrome (43477511577434).
The spelling of 11133201344323 in words is "eleven trillion, one hundred thirty-three billion, two hundred one million, three hundred forty-four thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •