Base | Representation |
---|---|
bin | 100001011010100… |
… | …0010100001010101 |
3 | 2220010201212112211 |
4 | 1002311002201111 |
5 | 4244011401323 |
6 | 303131113421 |
7 | 36533021200 |
oct | 10265024125 |
9 | 2803655484 |
10 | 1121200213 |
11 | 525985351 |
12 | 2735a2871 |
13 | 14b3944a3 |
14 | a8c9a937 |
15 | 6867270d |
hex | 42d42855 |
1121200213 has 12 divisors (see below), whose sum is σ = 1328864940. Its totient is φ = 942893952.
The previous prime is 1121200207. The next prime is 1121200231. The reversal of 1121200213 is 3120021211.
It can be written as a sum of positive squares in 2 ways, for example, as 983888689 + 137311524 = 31367^2 + 11718^2 .
It is not a de Polignac number, because 1121200213 - 29 = 1121199701 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1121200193 and 1121200202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121200243) 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, 213268 + ... + 218461.
It is an arithmetic number, because the mean of its divisors is an integer number (110738745).
Almost surely, 21121200213 is an apocalyptic number.
It is an amenable number.
1121200213 is a deficient number, since it is larger than the sum of its proper divisors (207664727).
1121200213 is an equidigital number, since it uses as much as digits as its factorization.
1121200213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 431796 (or 431789 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1121200213 is about 33484.3278714087. The cubic root of 1121200213 is about 1038.8696462097.
Adding to 1121200213 its reverse (3120021211), we get a palindrome (4241221424).
The spelling of 1121200213 in words is "one billion, one hundred twenty-one million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •