Base | Representation |
---|---|
bin | 1011110000111001011… |
… | …1001100001011011101 |
3 | 201022200000010110022221 |
4 | 2330032113030023131 |
5 | 11302402213020013 |
6 | 232502343105341 |
7 | 20413223152264 |
oct | 2741627141335 |
9 | 638600113287 |
10 | 202104423133 |
11 | 78791750478 |
12 | 33204442251 |
13 | 1609b2c8372 |
14 | 9ad379d5db |
15 | 53cd0b208d |
hex | 2f0e5cc2dd |
202104423133 has 4 divisors (see below), whose sum is σ = 202157907840. Its totient is φ = 202050938428.
The previous prime is 202104423121. The next prime is 202104423139. The reversal of 202104423133 is 331324401202.
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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202104423133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202104423098 and 202104423107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202104423139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26736685 + ... + 26744242.
It is an arithmetic number, because the mean of its divisors is an integer number (50539476960).
Almost surely, 2202104423133 is an apocalyptic number.
It is an amenable number.
202104423133 is a deficient number, since it is larger than the sum of its proper divisors (53484707).
202104423133 is an equidigital number, since it uses as much as digits as its factorization.
202104423133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53484706.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 202104423133 its reverse (331324401202), we get a palindrome (533428824335).
The spelling of 202104423133 in words is "two hundred two billion, one hundred four million, four hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •