Base | Representation |
---|---|
bin | 1010011001011000101100… |
… | …0101000010110101011101 |
3 | 1111110211000212022001100000 |
4 | 2212112023011002311131 |
5 | 2444242140240030023 |
6 | 40151234553524513 |
7 | 2256610550046201 |
oct | 246261305026535 |
9 | 44424025261300 |
10 | 11431241330013 |
11 | 3707a6479aa0a |
12 | 134754b713739 |
13 | 64bc6635c98b |
14 | 2b73bc990b01 |
15 | 14c545b7d243 |
hex | a658b142d5d |
11431241330013 has 192 divisors, whose sum is σ = 19994800250880. Its totient is φ = 6477607065600.
The previous prime is 11431241329931. The next prime is 11431241330029. The reversal of 11431241330013 is 31003314213411.
11431241330013 is a `hidden beast` number, since 1 + 1 + 4 + 312 + 4 + 1 + 330 + 0 + 13 = 666.
It is not a de Polignac number, because 11431241330013 - 210 = 11431241328989 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11431241330713) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 162986593 + ... + 163056713.
It is an arithmetic number, because the mean of its divisors is an integer number (104139584640).
Almost surely, 211431241330013 is an apocalyptic number.
It is an amenable number.
11431241330013 is a deficient number, since it is larger than the sum of its proper divisors (8563558920867).
11431241330013 is a wasteful number, since it uses less digits than its factorization.
11431241330013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70270 (or 70258 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 11431241330013 its reverse (31003314213411), we get a palindrome (42434555543424).
The spelling of 11431241330013 in words is "eleven trillion, four hundred thirty-one billion, two hundred forty-one million, three hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •