Base | Representation |
---|---|
bin | 110100001111111000… |
… | …1011110001100011001 |
3 | 101201121120020221110222 |
4 | 1220133301132030121 |
5 | 3314242231241441 |
6 | 123313414445425 |
7 | 11051322031646 |
oct | 1503761361431 |
9 | 351546227428 |
10 | 112202212121 |
11 | 4364825072a |
12 | 198b4363875 |
13 | a7718243bc |
14 | 5605878dcd |
15 | 2dba5eed4b |
hex | 1a1fc5e319 |
112202212121 has 4 divisors (see below), whose sum is σ = 112338878244. Its totient is φ = 112065546000.
The previous prime is 112202212099. The next prime is 112202212207. The reversal of 112202212121 is 121212202211.
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 15459440896 + 96742771225 = 124336^2 + 311035^2 .
It is a cyclic number.
It is not a de Polignac number, because 112202212121 - 210 = 112202211097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112202212121.
It is not an unprimeable number, because it can be changed into a prime (112202212021) 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, 68331830 + ... + 68333471.
It is an arithmetic number, because the mean of its divisors is an integer number (28084719561).
Almost surely, 2112202212121 is an apocalyptic number.
It is an amenable number.
112202212121 is a deficient number, since it is larger than the sum of its proper divisors (136666123).
112202212121 is an equidigital number, since it uses as much as digits as its factorization.
112202212121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136666122.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 112202212121 its reverse (121212202211), we get a palindrome (233414414332).
The spelling of 112202212121 in words is "one hundred twelve billion, two hundred two million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •