Base | Representation |
---|---|
bin | 1010000010111110000011… |
… | …1011000101010000011111 |
3 | 1110010000000002212020010122 |
4 | 2200233200323011100133 |
5 | 2421434440413034211 |
6 | 35254305114025155 |
7 | 2220025340035010 |
oct | 240574073052037 |
9 | 43100002766118 |
10 | 11046134502431 |
11 | 3579703a55476 |
12 | 12a49941181bb |
13 | 6218523a62c2 |
14 | 2a28c8765007 |
15 | 1425069e66db |
hex | a0be0ec541f |
11046134502431 has 32 divisors (see below), whose sum is σ = 13850670643200. Its totient is φ = 8600819230080.
The previous prime is 11046134502401. The next prime is 11046134502457. The reversal of 11046134502431 is 13420543164011.
It is not a de Polignac number, because 11046134502431 - 226 = 11046067393567 is a prime.
It is a super-2 number, since 2×110461345024312 (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 = 11046134502391 and 11046134502400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11046134502401) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19107371 + ... + 19676988.
It is an arithmetic number, because the mean of its divisors is an integer number (432833457600).
Almost surely, 211046134502431 is an apocalyptic number.
11046134502431 is a deficient number, since it is larger than the sum of its proper divisors (2804536140769).
11046134502431 is a wasteful number, since it uses less digits than its factorization.
11046134502431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38784479.
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 11046134502431 its reverse (13420543164011), we get a palindrome (24466677666442).
The spelling of 11046134502431 in words is "eleven trillion, forty-six billion, one hundred thirty-four million, five hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •