Base | Representation |
---|---|
bin | 1011110001010000011… |
… | …1101001001110110010 |
3 | 201022220201212122010212 |
4 | 2330110013221032302 |
5 | 11303101424323442 |
6 | 232520113224122 |
7 | 20415505144025 |
oct | 2742407511662 |
9 | 638821778125 |
10 | 202201011122 |
11 | 78831221460 |
12 | 33230862042 |
13 | 160b5315b16 |
14 | 9b025431bc |
15 | 53d67e0a82 |
hex | 2f141e93b2 |
202201011122 has 32 divisors (see below), whose sum is σ = 341739468288. Its totient is φ = 88894800000.
The previous prime is 202201011121. The next prime is 202201011137. The reversal of 202201011122 is 221110102202.
202201011122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 202201011097 and 202201011106.
It is not an unprimeable number, because it can be changed into a prime (202201011121) 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 15 ways as a sum of consecutive naturals, for example, 1145972 + ... + 1310592.
It is an arithmetic number, because the mean of its divisors is an integer number (10679358384).
Almost surely, 2202201011122 is an apocalyptic number.
202201011122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
202201011122 is a deficient number, since it is larger than the sum of its proper divisors (139538457166).
202201011122 is a wasteful number, since it uses less digits than its factorization.
202201011122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166466.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 202201011122 its reverse (221110102202), we get a palindrome (423311113324).
The spelling of 202201011122 in words is "two hundred two billion, two hundred one million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •