Base | Representation |
---|---|
bin | 1010010011001010000011… |
… | …1110000100111100111111 |
3 | 1111002120211100220210120210 |
4 | 2210302200332010330333 |
5 | 2441014013002420111 |
6 | 40030140444243503 |
7 | 2246102041241541 |
oct | 244624076047477 |
9 | 44076740823523 |
10 | 11324234420031 |
11 | 3676643120715 |
12 | 132a867240593 |
13 | 641b41c98070 |
14 | 2b214b0d5691 |
15 | 1498817120a6 |
hex | a4ca0f84f3f |
11324234420031 has 16 divisors (see below), whose sum is σ = 16606405960704. Its totient is φ = 6820488160224.
The previous prime is 11324234419933. The next prime is 11324234420053. The reversal of 11324234420031 is 13002443242311.
It is not a de Polignac number, because 11324234420031 - 210 = 11324234419007 is a prime.
It is a super-2 number, since 2×113242344200312 (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 (11324234420431) 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, 3088987371 + ... + 3088991036.
It is an arithmetic number, because the mean of its divisors is an integer number (1037900372544).
Almost surely, 211324234420031 is an apocalyptic number.
11324234420031 is a deficient number, since it is larger than the sum of its proper divisors (5282171540673).
11324234420031 is a wasteful number, since it uses less digits than its factorization.
11324234420031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6177978470.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 11324234420031 its reverse (13002443242311), we get a palindrome (24326677662342).
The spelling of 11324234420031 in words is "eleven trillion, three hundred twenty-four billion, two hundred thirty-four million, four hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •