Base | Representation |
---|---|
bin | 10100100011010000… |
… | …00110101110101001 |
3 | 1001110220210210120121 |
4 | 22101220012232221 |
5 | 140043441103413 |
6 | 5022450323241 |
7 | 540261115156 |
oct | 122150065651 |
9 | 31426723517 |
10 | 11033144233 |
11 | 4751a16621 |
12 | 217ab89521 |
13 | 106aa60817 |
14 | 76945b22d |
15 | 448939b8d |
hex | 291a06ba9 |
11033144233 has 4 divisors (see below), whose sum is σ = 11058277120. Its totient is φ = 11008011348.
The previous prime is 11033144231. The next prime is 11033144251. The reversal of 11033144233 is 33244133011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 33244133011 = 59621 ⋅557591.
It is a cyclic number.
It is not a de Polignac number, because 11033144233 - 21 = 11033144231 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11033144198 and 11033144207.
It is not an unprimeable number, because it can be changed into a prime (11033144231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12565785 + ... + 12566662.
It is an arithmetic number, because the mean of its divisors is an integer number (2764569280).
Almost surely, 211033144233 is an apocalyptic number.
It is an amenable number.
11033144233 is a deficient number, since it is larger than the sum of its proper divisors (25132887).
11033144233 is an equidigital number, since it uses as much as digits as its factorization.
11033144233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25132886.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 11033144233 its reverse (33244133011), we get a palindrome (44277277244).
The spelling of 11033144233 in words is "eleven billion, thirty-three million, one hundred forty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •