Base | Representation |
---|---|
bin | 1010010001111011110110… |
… | …1110010111011101100011 |
3 | 1111000120122100222120220201 |
4 | 2210132331232113131203 |
5 | 2440143014423114243 |
6 | 40012345424050031 |
7 | 2244426605532433 |
oct | 244367556273543 |
9 | 44016570876821 |
10 | 11303242004323 |
11 | 3668750489025 |
12 | 1326788a63917 |
13 | 63cb77b0a3c9 |
14 | 2b11190b82c3 |
15 | 1490537b204d |
hex | a47bdb97763 |
11303242004323 has 4 divisors (see below), whose sum is σ = 11360042215600. Its totient is φ = 11246441793048.
The previous prime is 11303242004303. The next prime is 11303242004399. The reversal of 11303242004323 is 32340024230311.
It is a happy number.
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 11303242004323 - 29 = 11303242003811 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11303242004291 and 11303242004300.
It is not an unprimeable number, because it can be changed into a prime (11303242004303) 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, 28400105340 + ... + 28400105737.
It is an arithmetic number, because the mean of its divisors is an integer number (2840010553900).
Almost surely, 211303242004323 is an apocalyptic number.
11303242004323 is a deficient number, since it is larger than the sum of its proper divisors (56800211277).
11303242004323 is an equidigital number, since it uses as much as digits as its factorization.
11303242004323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56800211276.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 11303242004323 its reverse (32340024230311), we get a palindrome (43643266234634).
The spelling of 11303242004323 in words is "eleven trillion, three hundred three billion, two hundred forty-two million, four thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •