Base | Representation |
---|---|
bin | 10100101011100110… |
… | …11011000100110101 |
3 | 1001122210200000111011 |
4 | 22111303123010311 |
5 | 140214411020041 |
6 | 5033432312221 |
7 | 542101545565 |
oct | 122563330465 |
9 | 31583600434 |
10 | 11103220021 |
11 | 47885295a3 |
12 | 219a542671 |
13 | 107c42799a |
14 | 77489cda5 |
15 | 44eb7ce81 |
hex | 295cdb135 |
11103220021 has 4 divisors (see below), whose sum is σ = 11107417312. Its totient is φ = 11099022732.
The previous prime is 11103220003. The next prime is 11103220027. The reversal of 11103220021 is 12002230111.
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: 12002230111 = 59 ⋅203427629.
It is a cyclic number.
It is not a de Polignac number, because 11103220021 - 25 = 11103219989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11103219983 and 11103220010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11103220027) 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, 2094675 + ... + 2099968.
It is an arithmetic number, because the mean of its divisors is an integer number (2776854328).
Almost surely, 211103220021 is an apocalyptic number.
It is an amenable number.
11103220021 is a deficient number, since it is larger than the sum of its proper divisors (4197291).
11103220021 is an equidigital number, since it uses as much as digits as its factorization.
11103220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4197290.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 11103220021 its reverse (12002230111), we get a palindrome (23105450132).
The spelling of 11103220021 in words is "eleven billion, one hundred three million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •