Base | Representation |
---|---|
bin | 1010011001111101000110… |
… | …0010001101001010101111 |
3 | 1111111202020220000021121010 |
4 | 2212133101202031022233 |
5 | 2444422143402023343 |
6 | 40155532353240303 |
7 | 2260404655411113 |
oct | 246372142151257 |
9 | 44452226007533 |
10 | 11441013314223 |
11 | 3711119827319 |
12 | 1349418263093 |
13 | 64cb62a3405c |
14 | 2b7a6871b743 |
15 | 14c9189ead33 |
hex | a67d188d2af |
11441013314223 has 8 divisors (see below), whose sum is σ = 15306748189488. Its totient is φ = 7601310324224.
The previous prime is 11441013314219. The next prime is 11441013314323. The reversal of 11441013314223 is 32241331014411.
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 11441013314223 - 22 = 11441013314219 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11441013314323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6507970290 + ... + 6507972047.
It is an arithmetic number, because the mean of its divisors is an integer number (1913343523686).
Almost surely, 211441013314223 is an apocalyptic number.
11441013314223 is a deficient number, since it is larger than the sum of its proper divisors (3865734875265).
11441013314223 is a wasteful number, since it uses less digits than its factorization.
11441013314223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13015942633.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 11441013314223 its reverse (32241331014411), we get a palindrome (43682344328634).
The spelling of 11441013314223 in words is "eleven trillion, four hundred forty-one billion, thirteen million, three hundred fourteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •