Base | Representation |
---|---|
bin | 1010000010110110110111… |
… | …0000110111001010011111 |
3 | 1110002211000110100110102121 |
4 | 2200231231300313022133 |
5 | 2421422011311142143 |
6 | 35253345255203411 |
7 | 2216626426562632 |
oct | 240555560671237 |
9 | 43084013313377 |
10 | 11044202443423 |
11 | 35789023a2996 |
12 | 12a4535076567 |
13 | 621605029516 |
14 | 2a2783d13c19 |
15 | 1424420a47ed |
hex | a0b6dc3729f |
11044202443423 has 8 divisors (see below), whose sum is σ = 11423413755936. Its totient is φ = 10670221632000.
The previous prime is 11044202443399. The next prime is 11044202443499. The reversal of 11044202443423 is 32434420244011.
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-11044202443423 is a prime.
It is a super-2 number, since 2×110442024434232 (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 (11044202443223) 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, 1307620978 + ... + 1307629423.
It is an arithmetic number, because the mean of its divisors is an integer number (1427926719492).
Almost surely, 211044202443423 is an apocalyptic number.
11044202443423 is a deficient number, since it is larger than the sum of its proper divisors (379211312513).
11044202443423 is a wasteful number, since it uses less digits than its factorization.
11044202443423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2615250545.
The product of its (nonzero) digits is 73728, while the sum is 34.
Adding to 11044202443423 its reverse (32434420244011), we get a palindrome (43478622687434).
The spelling of 11044202443423 in words is "eleven trillion, forty-four billion, two hundred two million, four hundred forty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •