Base | Representation |
---|---|
bin | 1011110001010000111… |
… | …1010110001001101010 |
3 | 201022220212200012200122 |
4 | 2330110033112021222 |
5 | 11303102433430442 |
6 | 232520224403242 |
7 | 20415531253232 |
oct | 2742417261152 |
9 | 638825605618 |
10 | 202203030122 |
11 | 78832380355 |
12 | 33231476522 |
13 | 160b5871ab2 |
14 | 9b0290acc2 |
15 | 53d6a8ddd2 |
hex | 2f143d626a |
202203030122 has 4 divisors (see below), whose sum is σ = 303304545186. Its totient is φ = 101101515060.
The previous prime is 202203030109. The next prime is 202203030167. The reversal of 202203030122 is 221030302202.
202203030122 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, and also an emirpimes, since its reverse is a distinct semiprime: 221030302202 = 2 ⋅110515151101.
It can be written as a sum of positive squares in only one way, i.e., 198228862441 + 3974167681 = 445229^2 + 63041^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 202203030122.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 50550757529 + ... + 50550757532.
Almost surely, 2202203030122 is an apocalyptic number.
202203030122 is a deficient number, since it is larger than the sum of its proper divisors (101101515064).
202203030122 is a wasteful number, since it uses less digits than its factorization.
202203030122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101101515063.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 202203030122 its reverse (221030302202), we get a palindrome (423233332324).
The spelling of 202203030122 in words is "two hundred two billion, two hundred three million, thirty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •