Base | Representation |
---|---|
bin | 1011110010110111000… |
… | …1011111111000001101 |
3 | 201101000201202022212211 |
4 | 2330231301133320031 |
5 | 11304442120211021 |
6 | 233030530230421 |
7 | 20432252410534 |
oct | 2745561377015 |
9 | 641021668784 |
10 | 202631413261 |
11 | 78a32171a02 |
12 | 33330a25411 |
13 | 16153540444 |
14 | 9b4377d31b |
15 | 540e4ac3e1 |
hex | 2f2dc5fe0d |
202631413261 has 4 divisors (see below), whose sum is σ = 202633232032. Its totient is φ = 202629594492.
The previous prime is 202631413213. The next prime is 202631413297. The reversal of 202631413261 is 162314136202.
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 202631413261 - 27 = 202631413133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202631413661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 730545 + ... + 968998.
It is an arithmetic number, because the mean of its divisors is an integer number (50658308008).
Almost surely, 2202631413261 is an apocalyptic number.
It is an amenable number.
202631413261 is a deficient number, since it is larger than the sum of its proper divisors (1818771).
202631413261 is a wasteful number, since it uses less digits than its factorization.
202631413261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1818770.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 202631413261 its reverse (162314136202), we get a palindrome (364945549463).
The spelling of 202631413261 in words is "two hundred two billion, six hundred thirty-one million, four hundred thirteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.226 sec. • engine limits •