Base | Representation |
---|---|
bin | 1010000010110111010101… |
… | …1100011011010100011111 |
3 | 1110002211100102211021012211 |
4 | 2200231311130123110133 |
5 | 2421422242303213343 |
6 | 35253410141141251 |
7 | 2216632553100250 |
oct | 240556534332437 |
9 | 43084312737184 |
10 | 11044331304223 |
11 | 3578969106a18 |
12 | 12a457025a827 |
13 | 621625936609 |
14 | 2a2797098b27 |
15 | 14244d55a79d |
hex | a0b7571b51f |
11044331304223 has 8 divisors (see below), whose sum is σ = 12774166328448. Its totient is φ = 9352514632344.
The previous prime is 11044331304217. The next prime is 11044331304233. The reversal of 11044331304223 is 32240313344011.
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-11044331304223 is a prime.
It is a super-2 number, since 2×110443313042232 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11044331304233) 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, 9504587461 + ... + 9504588622.
It is an arithmetic number, because the mean of its divisors is an integer number (1596770791056).
Almost surely, 211044331304223 is an apocalyptic number.
11044331304223 is a deficient number, since it is larger than the sum of its proper divisors (1729835024225).
11044331304223 is an equidigital number, since it uses as much as digits as its factorization.
11044331304223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19009176173.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 11044331304223 its reverse (32240313344011), we get a palindrome (43284644648234).
The spelling of 11044331304223 in words is "eleven trillion, forty-four billion, three hundred thirty-one million, three hundred four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •