Base | Representation |
---|---|
bin | 10000010100000110111… |
… | …001100010010010100101 |
3 | 10222011202112121010010222 |
4 | 100110012321202102211 |
5 | 121332004131211323 |
6 | 2215005515054125 |
7 | 143665646361206 |
oct | 20240671422245 |
9 | 3864675533128 |
10 | 1121102210213 |
11 | 3a2502a74947 |
12 | 16133aa41345 |
13 | 819479288ab |
14 | 3c393d055ad |
15 | 1e26838c9c8 |
hex | 10506e624a5 |
1121102210213 has 8 divisors (see below), whose sum is σ = 1130247061728. Its totient is φ = 1111982727024.
The previous prime is 1121102210201. The next prime is 1121102210219. The reversal of 1121102210213 is 3120122011211.
It is a happy number.
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 1121102210213 - 24 = 1121102210197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1121102210191 and 1121102210200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121102210219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6253331 + ... + 6430112.
It is an arithmetic number, because the mean of its divisors is an integer number (141280882716).
Almost surely, 21121102210213 is an apocalyptic number.
It is an amenable number.
1121102210213 is a deficient number, since it is larger than the sum of its proper divisors (9144851515).
1121102210213 is a wasteful number, since it uses less digits than its factorization.
1121102210213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12684163.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1121102210213 its reverse (3120122011211), we get a palindrome (4241224221424).
The spelling of 1121102210213 in words is "one trillion, one hundred twenty-one billion, one hundred two million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •