Base | Representation |
---|---|
bin | 1011110000111001001… |
… | …0001001001111111101 |
3 | 201022122220122020220022 |
4 | 2330032102021033331 |
5 | 11302401343203123 |
6 | 232502254501525 |
7 | 20413206003044 |
oct | 2741622111775 |
9 | 638586566808 |
10 | 202103100413 |
11 | 78790a27715 |
12 | 33203b048a5 |
13 | 1609ac542a6 |
14 | 9ad353755b |
15 | 53cce001c8 |
hex | 2f0e4893fd |
202103100413 has 4 divisors (see below), whose sum is σ = 202948720320. Its totient is φ = 201257480508.
The previous prime is 202103100401. The next prime is 202103100421. The reversal of 202103100413 is 314001301202.
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 not a de Polignac number, because 202103100413 - 218 = 202102838269 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202103100391 and 202103100400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202103108413) 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, 422809595 + ... + 422810072.
It is an arithmetic number, because the mean of its divisors is an integer number (50737180080).
Almost surely, 2202103100413 is an apocalyptic number.
It is an amenable number.
202103100413 is a deficient number, since it is larger than the sum of its proper divisors (845619907).
202103100413 is an equidigital number, since it uses as much as digits as its factorization.
202103100413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845619906.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 202103100413 its reverse (314001301202), we get a palindrome (516104401615).
The spelling of 202103100413 in words is "two hundred two billion, one hundred three million, one hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •