Base | Representation |
---|---|
bin | 1011110001000010101… |
… | …1111010101101010111 |
3 | 201022202201111020200011 |
4 | 2330100223322231113 |
5 | 11302442203123111 |
6 | 232510254501051 |
7 | 20414205433522 |
oct | 2742053725527 |
9 | 638681436604 |
10 | 202143411031 |
11 | 7880175a681 |
12 | 33215504787 |
13 | 160a63c9323 |
14 | 9ad8a2bbb9 |
15 | 53d1714021 |
hex | 2f10afab57 |
202143411031 has 4 divisors (see below), whose sum is σ = 205569570600. Its totient is φ = 198717251464.
The previous prime is 202143411017. The next prime is 202143411061. The reversal of 202143411031 is 130114341202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 202143411031 - 227 = 202009193303 is a prime.
It is a super-2 number, since 2×2021434110312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202143410993 and 202143411011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202143411061) 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, 1713079696 + ... + 1713079813.
It is an arithmetic number, because the mean of its divisors is an integer number (51392392650).
Almost surely, 2202143411031 is an apocalyptic number.
202143411031 is a deficient number, since it is larger than the sum of its proper divisors (3426159569).
202143411031 is an equidigital number, since it uses as much as digits as its factorization.
202143411031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3426159568.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 202143411031 its reverse (130114341202), we get a palindrome (332257752233).
The spelling of 202143411031 in words is "two hundred two billion, one hundred forty-three million, four hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •