Base | Representation |
---|---|
bin | 1010011101011001011001… |
… | …0110111110010001101111 |
3 | 1111201101220020020000202022 |
4 | 2213112112112332101233 |
5 | 3001404301403243142 |
6 | 40243032423020355 |
7 | 2264600303415122 |
oct | 247262626762157 |
9 | 44641806200668 |
10 | 11500150056047 |
11 | 3734205997774 |
12 | 1358980b9a6bb |
13 | 6555c8690393 |
14 | 2ba87869a3b9 |
15 | 14e22a57d6d2 |
hex | a75965be46f |
11500150056047 has 2 divisors, whose sum is σ = 11500150056048. Its totient is φ = 11500150056046.
The previous prime is 11500150056011. The next prime is 11500150056067. The reversal of 11500150056047 is 74065005100511.
It is a strong prime.
It is an emirp because it is prime and its reverse (74065005100511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11500150056047 - 26 = 11500150055983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11500150055998 and 11500150056016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11500150056067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5750075028023 + 5750075028024.
It is an arithmetic number, because the mean of its divisors is an integer number (5750075028024).
Almost surely, 211500150056047 is an apocalyptic number.
11500150056047 is a deficient number, since it is larger than the sum of its proper divisors (1).
11500150056047 is an equidigital number, since it uses as much as digits as its factorization.
11500150056047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21000, while the sum is 35.
Adding to 11500150056047 its reverse (74065005100511), we get a palindrome (85565155156558).
The spelling of 11500150056047 in words is "eleven trillion, five hundred billion, one hundred fifty million, fifty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •