Base | Representation |
---|---|
bin | 1010000111111010101110… |
… | …1010001010010100111111 |
3 | 1110102010102022010010000212 |
4 | 2201332223222022110333 |
5 | 2424333033344021343 |
6 | 35401324125343035 |
7 | 2226125013520022 |
oct | 241765352122477 |
9 | 43363368103025 |
10 | 11131140220223 |
11 | 3601765514401 |
12 | 12b9358407a7b |
13 | 62987b5bc3ba |
14 | 2a6a7024d1b9 |
15 | 14482e69ac18 |
hex | a1faba8a53f |
11131140220223 has 8 divisors (see below), whose sum is σ = 11516698448400. Its totient is φ = 10745697045888.
The previous prime is 11131140220171. The next prime is 11131140220231. The reversal of 11131140220223 is 32202204113111.
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 11131140220223 - 232 = 11126845252927 is a prime.
It is a super-2 number, since 2×111311402202232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11131140220283) 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, 28566593 + ... + 28953626.
It is an arithmetic number, because the mean of its divisors is an integer number (1439587306050).
Almost surely, 211131140220223 is an apocalyptic number.
11131140220223 is a deficient number, since it is larger than the sum of its proper divisors (385558228177).
11131140220223 is an equidigital number, since it uses as much as digits as its factorization.
11131140220223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57526921.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 11131140220223 its reverse (32202204113111), we get a palindrome (43333344333334).
The spelling of 11131140220223 in words is "eleven trillion, one hundred thirty-one billion, one hundred forty million, two hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •