Base | Representation |
---|---|
bin | 1010011001010111111000… |
… | …1101110101101010001011 |
3 | 1111110210110211020100110122 |
4 | 2212111332031311222023 |
5 | 2444241220014002111 |
6 | 40151201324333455 |
7 | 2256602316562124 |
oct | 246257615655213 |
9 | 44423424210418 |
10 | 11431025531531 |
11 | 37079639a7361 |
12 | 13474ab3a428b |
13 | 64bc30733778 |
14 | 2b739c05904b |
15 | 14c531c52cdb |
hex | a657e375a8b |
11431025531531 has 2 divisors, whose sum is σ = 11431025531532. Its totient is φ = 11431025531530.
The previous prime is 11431025531501. The next prime is 11431025531641. The reversal of 11431025531531 is 13513552013411.
It is a weak prime.
It is an emirp because it is prime and its reverse (13513552013411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11431025531531 - 234 = 11413845662347 is a prime.
It is a super-2 number, since 2×114310255315312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11431025531491 and 11431025531500.
It is not a weakly prime, because it can be changed into another prime (11431025531501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5715512765765 + 5715512765766.
It is an arithmetic number, because the mean of its divisors is an integer number (5715512765766).
Almost surely, 211431025531531 is an apocalyptic number.
11431025531531 is a deficient number, since it is larger than the sum of its proper divisors (1).
11431025531531 is an equidigital number, since it uses as much as digits as its factorization.
11431025531531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 35.
Adding to 11431025531531 its reverse (13513552013411), we get a palindrome (24944577544942).
The spelling of 11431025531531 in words is "eleven trillion, four hundred thirty-one billion, twenty-five million, five hundred thirty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •