Base | Representation |
---|---|
bin | 1010001100000011100100… |
… | …0000001000000010101111 |
3 | 1110122220220202001001101021 |
4 | 2203000321000020002233 |
5 | 2432014132121322343 |
6 | 35454122304355011 |
7 | 2234222504525524 |
oct | 243007100100257 |
9 | 43586822031337 |
10 | 11202231042223 |
11 | 3629926422161 |
12 | 130b098615a67 |
13 | 63349aa23050 |
14 | 2aa295a9514b |
15 | 1465e092d0ed |
hex | a30390080af |
11202231042223 has 8 divisors (see below), whose sum is σ = 12064725576288. Its totient is φ = 10339848573024.
The previous prime is 11202231042169. The next prime is 11202231042239. The reversal of 11202231042223 is 32224013220211.
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 11202231042223 - 237 = 11064792088751 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11202231049223) 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, 27808540 + ... + 28208497.
It is an arithmetic number, because the mean of its divisors is an integer number (1508090697036).
Almost surely, 211202231042223 is an apocalyptic number.
11202231042223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11202231042223 is a deficient number, since it is larger than the sum of its proper divisors (862494534065).
11202231042223 is a wasteful number, since it uses less digits than its factorization.
11202231042223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56032433.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 11202231042223 its reverse (32224013220211), we get a palindrome (43426244262434).
The spelling of 11202231042223 in words is "eleven trillion, two hundred two billion, two hundred thirty-one million, forty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •