Base | Representation |
---|---|
bin | 10100100011010001… |
… | …11000111111110011 |
3 | 1001110221012021000110 |
4 | 22101220320333303 |
5 | 140044014201011 |
6 | 5022454552403 |
7 | 540262633356 |
oct | 122150707763 |
9 | 31427167013 |
10 | 11033350131 |
11 | 4752047291 |
12 | 217b068703 |
13 | 106ab0345b |
14 | 7694b229d |
15 | 44897aba6 |
hex | 291a38ff3 |
11033350131 has 4 divisors (see below), whose sum is σ = 14711133512. Its totient is φ = 7355566752.
The previous prime is 11033350127. The next prime is 11033350193. The reversal of 11033350131 is 13105333011.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 11033350131 - 22 = 11033350127 is a prime.
It is a super-2 number, since 2×110333501312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11033350098 and 11033350107.
It is not an unprimeable number, because it can be changed into a prime (11033350231) 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 in 3 ways as a sum of consecutive naturals, for example, 1838891686 + ... + 1838891691.
It is an arithmetic number, because the mean of its divisors is an integer number (3677783378).
Almost surely, 211033350131 is an apocalyptic number.
11033350131 is a deficient number, since it is larger than the sum of its proper divisors (3677783381).
11033350131 is an equidigital number, since it uses as much as digits as its factorization.
11033350131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3677783380.
The product of its (nonzero) digits is 405, while the sum is 21.
Adding to 11033350131 its reverse (13105333011), we get a palindrome (24138683142).
The spelling of 11033350131 in words is "eleven billion, thirty-three million, three hundred fifty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •