Base | Representation |
---|---|
bin | 100100000101111… |
… | …1111001110101001 |
3 | 10010101220100210010 |
4 | 1020023333032221 |
5 | 4440020231441 |
6 | 320102042133 |
7 | 42004124655 |
oct | 11013771651 |
9 | 3111810703 |
10 | 1211102121 |
11 | 5716a9a49 |
12 | 299719349 |
13 | 163bb0898 |
14 | b6bbda65 |
15 | 714d0116 |
hex | 482ff3a9 |
1211102121 has 8 divisors (see below), whose sum is σ = 1632947040. Its totient is φ = 798329312.
The previous prime is 1211102069. The next prime is 1211102129. The reversal of 1211102121 is 1212011121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1211102121 - 214 = 1211085737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1211102097 and 1211102106.
It is not an unprimeable number, because it can be changed into a prime (1211102129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2267715 + ... + 2268248.
It is an arithmetic number, because the mean of its divisors is an integer number (204118380).
Almost surely, 21211102121 is an apocalyptic number.
It is an amenable number.
1211102121 is a deficient number, since it is larger than the sum of its proper divisors (421844919).
1211102121 is an equidigital number, since it uses as much as digits as its factorization.
1211102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4536055.
The product of its (nonzero) digits is 8, while the sum is 12.
The square root of 1211102121 is about 34800.8925316579. The cubic root of 1211102121 is about 1065.9256709846.
Adding to 1211102121 its reverse (1212011121), we get a palindrome (2423113242).
The spelling of 1211102121 in words is "one billion, two hundred eleven million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •