Base | Representation |
---|---|
bin | 1010000000010111011111… |
… | …1111010010001101110001 |
3 | 1102221201121011202210202110 |
4 | 2200011313333102031301 |
5 | 2420221404111322231 |
6 | 35221552355435533 |
7 | 2213553356552646 |
oct | 240056777221561 |
9 | 42851534683673 |
10 | 11001424323441 |
11 | 3561750251222 |
12 | 12981968b5ba9 |
13 | 61a57853aaa6 |
14 | 2a06867b9dcd |
15 | 14128b756046 |
hex | a0177fd2371 |
11001424323441 has 16 divisors (see below), whose sum is σ = 15174496497600. Its totient is φ = 7081321453248.
The previous prime is 11001424323359. The next prime is 11001424323473. The reversal of 11001424323441 is 14432342410011.
It is a happy number.
It is not a de Polignac number, because 11001424323441 - 27 = 11001424323313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11001424323399 and 11001424323408.
It is not an unprimeable number, because it can be changed into a prime (11001424123441) 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 15 ways as a sum of consecutive naturals, for example, 12799870 + ... + 13632296.
It is an arithmetic number, because the mean of its divisors is an integer number (948406031100).
Almost surely, 211001424323441 is an apocalyptic number.
It is an amenable number.
11001424323441 is a deficient number, since it is larger than the sum of its proper divisors (4173072174159).
11001424323441 is a wasteful number, since it uses less digits than its factorization.
11001424323441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 984368.
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 11001424323441 its reverse (14432342410011), we get a palindrome (25433766733452).
The spelling of 11001424323441 in words is "eleven trillion, one billion, four hundred twenty-four million, three hundred twenty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •