Base | Representation |
---|---|
bin | 1010011111110110100000… |
… | …0111110100010100100111 |
3 | 1111212102202101221120101122 |
4 | 2213331220013310110213 |
5 | 3003102134421113020 |
6 | 40314245341044155 |
7 | 2300622356152031 |
oct | 247755007642447 |
9 | 44772671846348 |
10 | 11542324004135 |
11 | 3750087aa1121 |
12 | 1364b90b5665b |
13 | 659589c52352 |
14 | 2bc919882c51 |
15 | 150397d38125 |
hex | a7f681f4527 |
11542324004135 has 8 divisors (see below), whose sum is σ = 13866510477456. Its totient is φ = 9223378088320.
The previous prime is 11542324004119. The next prime is 11542324004137. The reversal of 11542324004135 is 53140042324511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11542324004135 - 24 = 11542324004119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11542324004095 and 11542324004104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11542324004137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1310134529 + ... + 1310143338.
It is an arithmetic number, because the mean of its divisors is an integer number (1733313809682).
Almost surely, 211542324004135 is an apocalyptic number.
11542324004135 is a deficient number, since it is larger than the sum of its proper divisors (2324186473321).
11542324004135 is an equidigital number, since it uses as much as digits as its factorization.
11542324004135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2620278753.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 11542324004135 its reverse (53140042324511), we get a palindrome (64682366328646).
The spelling of 11542324004135 in words is "eleven trillion, five hundred forty-two billion, three hundred twenty-four million, four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •