Base | Representation |
---|---|
bin | 10100100010000110… |
… | …00110010010111011 |
3 | 1001110020112221011112 |
4 | 22101003012102323 |
5 | 140034000140011 |
6 | 5021502350535 |
7 | 540112502111 |
oct | 122103062273 |
9 | 31406487145 |
10 | 11023443131 |
11 | 474749aa88 |
12 | 217788b44b |
13 | 1068a4501c |
14 | 768053ab1 |
15 | 447b7058b |
hex | 2910c64bb |
11023443131 has 4 divisors (see below), whose sum is σ = 11126466072. Its totient is φ = 10920420192.
The previous prime is 11023443097. The next prime is 11023443133. The reversal of 11023443131 is 13134432011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13134432011 = 4817 ⋅2726683.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11023443131 is a prime.
It is a super-2 number, since 2×110234431312 (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 = 11023443097 and 11023443106.
It is not an unprimeable number, because it can be changed into a prime (11023443133) 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, 51511310 + ... + 51511523.
It is an arithmetic number, because the mean of its divisors is an integer number (2781616518).
Almost surely, 211023443131 is an apocalyptic number.
11023443131 is a deficient number, since it is larger than the sum of its proper divisors (103022941).
11023443131 is a wasteful number, since it uses less digits than its factorization.
11023443131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103022940.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11023443131 its reverse (13134432011), we get a palindrome (24157875142).
The spelling of 11023443131 in words is "eleven billion, twenty-three million, four hundred forty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •