Base | Representation |
---|---|
bin | 10000010101000011101… |
… | …011110011100010011101 |
3 | 10222021101121112212120122 |
4 | 100111003223303202131 |
5 | 121341101214133041 |
6 | 2215255025124325 |
7 | 144033141542441 |
oct | 20250353634235 |
9 | 3867347485518 |
10 | 1122122021021 |
11 | 3a29866998a1 |
12 | 1615844896a5 |
13 | 81a7acb1041 |
14 | 3c44d52c821 |
15 | 1e2c7b83c4b |
hex | 10543af389d |
1122122021021 has 4 divisors (see below), whose sum is σ = 1149490850844. Its totient is φ = 1094753191200.
The previous prime is 1122122020969. The next prime is 1122122021063. The reversal of 1122122021021 is 1201202212211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 153844372900 + 968277648121 = 392230^2 + 984011^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122122021021 - 214 = 1122122004637 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122122021071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13684414850 + ... + 13684414931.
It is an arithmetic number, because the mean of its divisors is an integer number (287372712711).
Almost surely, 21122122021021 is an apocalyptic number.
It is an amenable number.
1122122021021 is a deficient number, since it is larger than the sum of its proper divisors (27368829823).
1122122021021 is an equidigital number, since it uses as much as digits as its factorization.
1122122021021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27368829822.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1122122021021 its reverse (1201202212211), we get a palindrome (2323324233232).
The spelling of 1122122021021 in words is "one trillion, one hundred twenty-two billion, one hundred twenty-two million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •