Base | Representation |
---|---|
bin | 1100111011000001001… |
… | …1000100011101001111 |
3 | 210020000122021102211120 |
4 | 3032300103010131033 |
5 | 12114124241333403 |
6 | 245552542252023 |
7 | 22016252252136 |
oct | 3166023043517 |
9 | 706018242746 |
10 | 222001121103 |
11 | 86171933113 |
12 | 37037887013 |
13 | 17c1c474528 |
14 | aa6007491d |
15 | 5b94c24e53 |
hex | 33b04c474f |
222001121103 has 4 divisors (see below), whose sum is σ = 296001494808. Its totient is φ = 148000747400.
The previous prime is 222001121093. The next prime is 222001121107. The reversal of 222001121103 is 301121100222.
222001121103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 222001121103 - 214 = 222001104719 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222001121107) 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 in 3 ways as a sum of consecutive naturals, for example, 37000186848 + ... + 37000186853.
It is an arithmetic number, because the mean of its divisors is an integer number (74000373702).
Almost surely, 2222001121103 is an apocalyptic number.
222001121103 is a deficient number, since it is larger than the sum of its proper divisors (74000373705).
222001121103 is an equidigital number, since it uses as much as digits as its factorization.
222001121103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74000373704.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 222001121103 its reverse (301121100222), we get a palindrome (523122221325).
The spelling of 222001121103 in words is "two hundred twenty-two billion, one million, one hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •