Base | Representation |
---|---|
bin | 1011110000111001000… |
… | …1110000110010011110 |
3 | 201022122220110011110112 |
4 | 2330032101300302132 |
5 | 11302401332001342 |
6 | 232502252410022 |
7 | 20413205104664 |
oct | 2741621606236 |
9 | 638586404415 |
10 | 202103000222 |
11 | 78790969412 |
12 | 33203a76912 |
13 | 1609ac1a7c6 |
14 | 9ad350cc34 |
15 | 53ccdd0682 |
hex | 2f0e470c9e |
202103000222 has 8 divisors (see below), whose sum is σ = 303812103672. Its totient is φ = 100832299000.
The previous prime is 202103000207. The next prime is 202103000227. The reversal of 202103000222 is 222000301202.
202103000222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 202103000197 and 202103000206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202103000227) 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, 109599404 + ... + 109601247.
It is an arithmetic number, because the mean of its divisors is an integer number (37976512959).
Almost surely, 2202103000222 is an apocalyptic number.
202103000222 is a deficient number, since it is larger than the sum of its proper divisors (101709103450).
202103000222 is a wasteful number, since it uses less digits than its factorization.
202103000222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219201114.
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 202103000222 its reverse (222000301202), we get a palindrome (424103301424).
The spelling of 202103000222 in words is "two hundred two billion, one hundred three million, two hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •