Base | Representation |
---|---|
bin | 110100010000011011… |
… | …0001011001100000101 |
3 | 101201122211010221200102 |
4 | 1220200312023030011 |
5 | 3314311334102323 |
6 | 123315300453445 |
7 | 11051631102341 |
oct | 1504066131405 |
9 | 351584127612 |
10 | 112220222213 |
11 | 43657431a00 |
12 | 198ba3aa285 |
13 | a77548bb68 |
14 | 5608006621 |
15 | 2dbbeab328 |
hex | 1a20d8b305 |
112220222213 has 6 divisors (see below), whose sum is σ = 123349500582. Its totient is φ = 102018383720.
The previous prime is 112220222159. The next prime is 112220222221. The reversal of 112220222213 is 312222022211.
It can be written as a sum of positive squares in only one way, i.e., 104324478049 + 7895744164 = 322993^2 + 88858^2 .
It is a de Polignac number, because none of the positive numbers 2k-112220222213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112220222243) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 463719806 + ... + 463720047.
It is an arithmetic number, because the mean of its divisors is an integer number (20558250097).
Almost surely, 2112220222213 is an apocalyptic number.
It is an amenable number.
112220222213 is a deficient number, since it is larger than the sum of its proper divisors (11129278369).
112220222213 is an equidigital number, since it uses as much as digits as its factorization.
112220222213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 927439875 (or 927439864 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 112220222213 its reverse (312222022211), we get a palindrome (424442244424).
It can be divided in two parts, 112220 and 222213, that added together give a palindrome (334433).
The spelling of 112220222213 in words is "one hundred twelve billion, two hundred twenty million, two hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •