Base | Representation |
---|---|
bin | 1010010011100011101110… |
… | …0100000000000110111111 |
3 | 1111010020121110000221120020 |
4 | 2210320323210000012333 |
5 | 2441122114443121343 |
6 | 40033240203023223 |
7 | 2246434535336166 |
oct | 244707344000677 |
9 | 44106543027506 |
10 | 11331123020223 |
11 | 36795585a7a26 |
12 | 133006a20ab13 |
13 | 64269c198756 |
14 | 2b2601d343dd |
15 | 149b36373b83 |
hex | a4e3b9001bf |
11331123020223 has 4 divisors (see below), whose sum is σ = 15108164026968. Its totient is φ = 7554082013480.
The previous prime is 11331123020207. The next prime is 11331123020293. The reversal of 11331123020223 is 32202032113311.
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 11331123020223 - 24 = 11331123020207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11331123020193 and 11331123020202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331123020293) 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, 1888520503368 + ... + 1888520503373.
It is an arithmetic number, because the mean of its divisors is an integer number (3777041006742).
Almost surely, 211331123020223 is an apocalyptic number.
11331123020223 is a deficient number, since it is larger than the sum of its proper divisors (3777041006745).
11331123020223 is an equidigital number, since it uses as much as digits as its factorization.
11331123020223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3777041006744.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 11331123020223 its reverse (32202032113311), we get a palindrome (43533155133534).
The spelling of 11331123020223 in words is "eleven trillion, three hundred thirty-one billion, one hundred twenty-three million, twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •