Base | Representation |
---|---|
bin | 10100111011000110… |
… | …10011001011110001 |
3 | 1001222212021020202100 |
4 | 22131203103023301 |
5 | 141001200223441 |
6 | 5054354411013 |
7 | 545240501436 |
oct | 123543231361 |
9 | 31885236670 |
10 | 11233211121 |
11 | 4844944860 |
12 | 2215b90a69 |
13 | 10a033c3b2 |
14 | 787c59b8d |
15 | 45b2a8cb6 |
hex | 29d8d32f1 |
11233211121 has 12 divisors (see below), whose sum is σ = 17700817680. Its totient is φ = 6808006680.
The previous prime is 11233211117. The next prime is 11233211123. The reversal of 11233211121 is 12111233211.
It is not a de Polignac number, because 11233211121 - 22 = 11233211117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11233211094 and 11233211103.
It is not an unprimeable number, because it can be changed into a prime (11233211123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 56733291 + ... + 56733488.
It is an arithmetic number, because the mean of its divisors is an integer number (1475068140).
Almost surely, 211233211121 is an apocalyptic number.
11233211121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11233211121 is a deficient number, since it is larger than the sum of its proper divisors (6467606559).
11233211121 is a wasteful number, since it uses less digits than its factorization.
11233211121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113466796 (or 113466793 counting only the distinct ones).
The product of its digits is 72, while the sum is 18.
Adding to 11233211121 its reverse (12111233211), we get a palindrome (23344444332).
It can be divided in two parts, 112 and 33211121, that added together give a palindrome (33211233).
The spelling of 11233211121 in words is "eleven billion, two hundred thirty-three million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •