Base | Representation |
---|---|
bin | 1010001100101011101110… |
… | …0011010001111001011111 |
3 | 1110200221202000212100100110 |
4 | 2203022323203101321133 |
5 | 2432203221333332203 |
6 | 35503104121301103 |
7 | 2235053604600351 |
oct | 243127343217137 |
9 | 43627660770313 |
10 | 11213011230303 |
11 | 3633458576003 |
12 | 13111a6934793 |
13 | 6344c824776c |
14 | 2aa9d96a70d1 |
15 | 146a2204cd03 |
hex | a32bb8d1e5f |
11213011230303 has 8 divisors (see below), whose sum is σ = 14953513766400. Its totient is φ = 7473924757208.
The previous prime is 11213011230263. The next prime is 11213011230307. The reversal of 11213011230303 is 30303211031211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11213011230303 - 222 = 11213007035999 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11213011230303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11213011230307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 353997273 + ... + 354028946.
It is an arithmetic number, because the mean of its divisors is an integer number (1869189220800).
Almost surely, 211213011230303 is an apocalyptic number.
11213011230303 is a deficient number, since it is larger than the sum of its proper divisors (3740502536097).
11213011230303 is an equidigital number, since it uses as much as digits as its factorization.
11213011230303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708031501.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11213011230303 its reverse (30303211031211), we get a palindrome (41516222261514).
The spelling of 11213011230303 in words is "eleven trillion, two hundred thirteen billion, eleven million, two hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •