Base | Representation |
---|---|
bin | 10000010011010001110… |
… | …110000111011001110010 |
3 | 10222002110111201220120022 |
4 | 100103101312013121302 |
5 | 121323143300334302 |
6 | 2214341321243442 |
7 | 143634620631416 |
oct | 20232166073162 |
9 | 3862414656508 |
10 | 1120212121202 |
11 | 3a20965a1899 |
12 | 161130933582 |
13 | 818353c23c5 |
14 | 3c30ba08d46 |
15 | 1e21516c8a2 |
hex | 104d1d87672 |
1120212121202 has 4 divisors (see below), whose sum is σ = 1680318181806. Its totient is φ = 560106060600.
The previous prime is 1120212121201. The next prime is 1120212121213. The reversal of 1120212121202 is 2021212120211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 1056843624841 + 63368496361 = 1028029^2 + 251731^2 .
It is not an unprimeable number, because it can be changed into a prime (1120212121201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 280053030299 + ... + 280053030302.
Almost surely, 21120212121202 is an apocalyptic number.
1120212121202 is a deficient number, since it is larger than the sum of its proper divisors (560106060604).
1120212121202 is an equidigital number, since it uses as much as digits as its factorization.
1120212121202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560106060603.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1120212121202 its reverse (2021212120211), we get a palindrome (3141424241413).
Subtracting 1120212121202 from its reverse (2021212120211), we obtain a palindrome (900999999009).
It can be divided in two parts, 11 and 20212121202, that multiplied together give a palindrome (222333333222).
The spelling of 1120212121202 in words is "one trillion, one hundred twenty billion, two hundred twelve million, one hundred twenty-one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •