Base | Representation |
---|---|
bin | 10100101101111101… |
… | …11101010011011101 |
3 | 1001201011221000100112 |
4 | 22112332331103131 |
5 | 140234443133041 |
6 | 5035420535405 |
7 | 542432055500 |
oct | 122676752335 |
9 | 31634830315 |
10 | 11123021021 |
11 | 4798723362 |
12 | 21a50b1565 |
13 | 108356b658 |
14 | 777375137 |
15 | 45178edeb |
hex | 296fbd4dd |
11123021021 has 48 divisors (see below), whose sum is σ = 14232672000. Its totient is φ = 8632310400.
The previous prime is 11123021009. The next prime is 11123021033. The reversal of 11123021021 is 12012032111.
It is an interprime number because it is at equal distance from previous prime (11123021009) and next prime (11123021033).
It is not a de Polignac number, because 11123021021 - 210 = 11123019997 is a prime.
11123021021 is a modest number, since divided by 21021 gives 11123 as remainder.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11123020987 and 11123021005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11123021071) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2724860 + ... + 2728938.
It is an arithmetic number, because the mean of its divisors is an integer number (296514000).
Almost surely, 211123021021 is an apocalyptic number.
It is an amenable number.
11123021021 is a deficient number, since it is larger than the sum of its proper divisors (3109650979).
11123021021 is a wasteful number, since it uses less digits than its factorization.
11123021021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4242 (or 4235 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11123021021 its reverse (12012032111), we get a palindrome (23135053132).
The spelling of 11123021021 in words is "eleven billion, one hundred twenty-three million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •