Base | Representation |
---|---|
bin | 1100110100010011110… |
… | …0101110000100011011 |
3 | 210001101010100002111211 |
4 | 3031010330232010123 |
5 | 12101432211200443 |
6 | 245054124203551 |
7 | 21623522653123 |
oct | 3150474560433 |
9 | 701333302454 |
10 | 220200100123 |
11 | 85428241423 |
12 | 368146995b7 |
13 | 179c32b7843 |
14 | a92cbb3c83 |
15 | 5adba6919d |
hex | 3344f2e11b |
220200100123 has 4 divisors (see below), whose sum is σ = 225321032728. Its totient is φ = 215079167520.
The previous prime is 220200100121. The next prime is 220200100151. The reversal of 220200100123 is 321001002022.
220200100123 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 220200100123 - 21 = 220200100121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220200100121) 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, 2560466238 + ... + 2560466323.
It is an arithmetic number, because the mean of its divisors is an integer number (56330258182).
Almost surely, 2220200100123 is an apocalyptic number.
220200100123 is a deficient number, since it is larger than the sum of its proper divisors (5120932605).
220200100123 is an equidigital number, since it uses as much as digits as its factorization.
220200100123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5120932604.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 220200100123 its reverse (321001002022), we get a palindrome (541201102145).
The spelling of 220200100123 in words is "two hundred twenty billion, two hundred million, one hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •