Base | Representation |
---|---|
bin | 1011110001010000010… |
… | …0001011000011101110 |
3 | 201022220200011101211102 |
4 | 2330110010023003232 |
5 | 11303101211213402 |
6 | 232520041523102 |
7 | 20415464333636 |
oct | 2742404130356 |
9 | 638820141742 |
10 | 202200101102 |
11 | 7883075a77a |
12 | 332304a3492 |
13 | 160b508784c |
14 | 9b023876c6 |
15 | 53d66b1102 |
hex | 2f1410b0ee |
202200101102 has 4 divisors (see below), whose sum is σ = 303300151656. Its totient is φ = 101100050550.
The previous prime is 202200101069. The next prime is 202200101111. The reversal of 202200101102 is 201101002202.
It is a happy number.
202200101102 is digitally balanced in base 3, 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, and also an emirpimes, since its reverse is a distinct semiprime: 201101002202 = 2 ⋅100550501101.
It is a super-2 number, since 2×2022001011022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550025274 + ... + 50550025277.
It is an arithmetic number, because the mean of its divisors is an integer number (75825037914).
Almost surely, 2202200101102 is an apocalyptic number.
202200101102 is a deficient number, since it is larger than the sum of its proper divisors (101100050554).
202200101102 is a wasteful number, since it uses less digits than its factorization.
202200101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101100050553.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 202200101102 its reverse (201101002202), we get a palindrome (403301103304).
The spelling of 202200101102 in words is "two hundred two billion, two hundred million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •