Base | Representation |
---|---|
bin | 1010000000011110001110… |
… | …1100011100000101000001 |
3 | 1102221220021002221212101001 |
4 | 2200013203230130011001 |
5 | 2420234104204304213 |
6 | 35222451550012001 |
7 | 2213646221030410 |
oct | 240074354340501 |
9 | 42856232855331 |
10 | 11003231322433 |
11 | 3562498256319 |
12 | 12985bbaa7001 |
13 | 61a7a5a0b76c |
14 | 2a07b8795477 |
15 | 1413451e31dd |
hex | a01e3b1c141 |
11003231322433 has 8 divisors (see below), whose sum is σ = 12619556571968. Its totient is φ = 9398014838064.
The previous prime is 11003231322409. The next prime is 11003231322439. The reversal of 11003231322433 is 33422313230011.
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-11003231322433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11003231322439) 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, 2777189166 + ... + 2777193127.
It is an arithmetic number, because the mean of its divisors is an integer number (1577444571496).
Almost surely, 211003231322433 is an apocalyptic number.
It is an amenable number.
11003231322433 is a deficient number, since it is larger than the sum of its proper divisors (1616325249535).
11003231322433 is an equidigital number, since it uses as much as digits as its factorization.
11003231322433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5554382583.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 11003231322433 its reverse (33422313230011), we get a palindrome (44425544552444).
The spelling of 11003231322433 in words is "eleven trillion, three billion, two hundred thirty-one million, three hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •