Base | Representation |
---|---|
bin | 1010001011111011010100… |
… | …1101101101110010111111 |
3 | 1110122201012122121002102021 |
4 | 2202332311031231302333 |
5 | 2432000120110342343 |
6 | 35453115042341011 |
7 | 2234113636220110 |
oct | 242766515556277 |
9 | 43581178532367 |
10 | 11200020012223 |
11 | 36289a1349639 |
12 | 130a78005a767 |
13 | 63320792c083 |
14 | 2aa126186207 |
15 | 1465117830ed |
hex | a2fb536dcbf |
11200020012223 has 8 divisors (see below), whose sum is σ = 12803960154240. Its totient is φ = 9597064191000.
The previous prime is 11200020012193. The next prime is 11200020012281. The reversal of 11200020012223 is 32221002000211.
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 a de Polignac number, because none of the positive numbers 2k-11200020012223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11200020012197 and 11200020012206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11200020013223) 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, 246055813 + ... + 246101326.
It is an arithmetic number, because the mean of its divisors is an integer number (1600495019280).
Almost surely, 211200020012223 is an apocalyptic number.
11200020012223 is a deficient number, since it is larger than the sum of its proper divisors (1603940142017).
11200020012223 is an equidigital number, since it uses as much as digits as its factorization.
11200020012223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 492160397.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 11200020012223 its reverse (32221002000211), we get a palindrome (43421022012434).
The spelling of 11200020012223 in words is "eleven trillion, two hundred billion, twenty million, twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •