Base | Representation |
---|---|
bin | 10101011110101010… |
… | …10000110110001111 |
3 | 1002202122120222120001 |
4 | 22233111100312033 |
5 | 142104032141143 |
6 | 5144132305131 |
7 | 555522212662 |
oct | 125725206617 |
9 | 32678528501 |
10 | 11531521423 |
11 | 49882747a4 |
12 | 2299a721a7 |
13 | 111a098076 |
14 | 7b570d6d9 |
15 | 47758214d |
hex | 2af550d8f |
11531521423 has 2 divisors, whose sum is σ = 11531521424. Its totient is φ = 11531521422.
The previous prime is 11531521409. The next prime is 11531521429. The reversal of 11531521423 is 32412513511.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11531521423 - 233 = 2941586831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11531521391 and 11531521400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11531521429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5765760711 + 5765760712.
It is an arithmetic number, because the mean of its divisors is an integer number (5765760712).
Almost surely, 211531521423 is an apocalyptic number.
11531521423 is a deficient number, since it is larger than the sum of its proper divisors (1).
11531521423 is an equidigital number, since it uses as much as digits as its factorization.
11531521423 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3600, while the sum is 28.
The spelling of 11531521423 in words is "eleven billion, five hundred thirty-one million, five hundred twenty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •