Base | Representation |
---|---|
bin | 1010001000101000000001… |
… | …1111111100001000001111 |
3 | 1110110021210210210212020221 |
4 | 2202022000133330020033 |
5 | 2430032440030202343 |
6 | 35411054541452211 |
7 | 2230035246603166 |
oct | 242120037741017 |
9 | 43407723725227 |
10 | 11143301022223 |
11 | 3606935a15997 |
12 | 12bb790b71067 |
13 | 62aa68b65726 |
14 | 2a74a53683dd |
15 | 144ce20d15ed |
hex | a22807fc20f |
11143301022223 has 4 divisors (see below), whose sum is σ = 11527552781640. Its totient is φ = 10759049262808.
The previous prime is 11143301022197. The next prime is 11143301022283. The reversal of 11143301022223 is 32222010334111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11143301022223 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 (11143301022283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 192125879665 + ... + 192125879722.
It is an arithmetic number, because the mean of its divisors is an integer number (2881888195410).
Almost surely, 211143301022223 is an apocalyptic number.
11143301022223 is a deficient number, since it is larger than the sum of its proper divisors (384251759417).
11143301022223 is an equidigital number, since it uses as much as digits as its factorization.
11143301022223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384251759416.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 11143301022223 its reverse (32222010334111), we get a palindrome (43365311356334).
The spelling of 11143301022223 in words is "eleven trillion, one hundred forty-three billion, three hundred one million, twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •