Base | Representation |
---|---|
bin | 1011110001000010101… |
… | …0110100001011001001 |
3 | 201022202200221120100210 |
4 | 2330100222310023021 |
5 | 11302442114401441 |
6 | 232510244351333 |
7 | 20414203121313 |
oct | 2742052641311 |
9 | 638680846323 |
10 | 202143122121 |
11 | 78801582606 |
12 | 332153a5549 |
13 | 160a6327985 |
14 | 9ad89947b3 |
15 | 53d16a8616 |
hex | 2f10ab42c9 |
202143122121 has 4 divisors (see below), whose sum is σ = 269524162832. Its totient is φ = 134762081412.
The previous prime is 202143122033. The next prime is 202143122141. The reversal of 202143122121 is 121221341202.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 202143122121 - 210 = 202143121097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202143122141) by changing a digit.
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 in 3 ways as a sum of consecutive naturals, for example, 33690520351 + ... + 33690520356.
It is an arithmetic number, because the mean of its divisors is an integer number (67381040708).
Almost surely, 2202143122121 is an apocalyptic number.
It is an amenable number.
202143122121 is a deficient number, since it is larger than the sum of its proper divisors (67381040711).
202143122121 is an equidigital number, since it uses as much as digits as its factorization.
202143122121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67381040710.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 202143122121 its reverse (121221341202), we get a palindrome (323364463323).
The spelling of 202143122121 in words is "two hundred two billion, one hundred forty-three million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •