Base | Representation |
---|---|
bin | 1010000010110100010101… |
… | …0010111010110001001111 |
3 | 1110002202021010210211022122 |
4 | 2200231011102322301033 |
5 | 2421414114004131411 |
6 | 35253154043203155 |
7 | 2216603543652200 |
oct | 240550522726117 |
9 | 43082233724278 |
10 | 11043523505231 |
11 | 3578594129648 |
12 | 12a43858164bb |
13 | 621527482949 |
14 | 2a271ba9d5a7 |
15 | 1424026929db |
hex | a0b454bac4f |
11043523505231 has 24 divisors (see below), whose sum is σ = 12880666656000. Its totient is φ = 9440741212224.
The previous prime is 11043523505173. The next prime is 11043523505233. The reversal of 11043523505231 is 13250532534011.
It is a happy number.
It is not a de Polignac number, because 11043523505231 - 218 = 11043523243087 is a prime.
It is a super-2 number, since 2×110435235052312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11043523505191 and 11043523505200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11043523505233) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 371083730 + ... + 371113488.
It is an arithmetic number, because the mean of its divisors is an integer number (536694444000).
Almost surely, 211043523505231 is an apocalyptic number.
11043523505231 is a deficient number, since it is larger than the sum of its proper divisors (1837143150769).
11043523505231 is a wasteful number, since it uses less digits than its factorization.
11043523505231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49631 (or 49624 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 35.
The spelling of 11043523505231 in words is "eleven trillion, forty-three billion, five hundred twenty-three million, five hundred five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •