Base | Representation |
---|---|
bin | 1010001000101110011001… |
… | …1001000101001000100011 |
3 | 1110110110012221111100002112 |
4 | 2202023212121011020203 |
5 | 2430044440142001011 |
6 | 35411540325505535 |
7 | 2230125515121614 |
oct | 242134631051043 |
9 | 43413187440075 |
10 | 11145010500131 |
11 | 3607632971a52 |
12 | 12bbb895722ab |
13 | 62ac7c080011 |
14 | 2a75c83d9c0b |
15 | 144d9220858b |
hex | a22e6645223 |
11145010500131 has 2 divisors, whose sum is σ = 11145010500132. Its totient is φ = 11145010500130.
The previous prime is 11145010500079. The next prime is 11145010500181. The reversal of 11145010500131 is 13100501054111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11145010500131 - 230 = 11143936758307 is a prime.
It is a super-2 number, since 2×111450105001312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11145010500097 and 11145010500106.
It is not a weakly prime, because it can be changed into another prime (11145010500181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5572505250065 + 5572505250066.
It is an arithmetic number, because the mean of its divisors is an integer number (5572505250066).
Almost surely, 211145010500131 is an apocalyptic number.
11145010500131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11145010500131 is an equidigital number, since it uses as much as digits as its factorization.
11145010500131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 300, while the sum is 23.
Adding to 11145010500131 its reverse (13100501054111), we get a palindrome (24245511554242).
The spelling of 11145010500131 in words is "eleven trillion, one hundred forty-five billion, ten million, five hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •