Base | Representation |
---|---|
bin | 11000000101001… |
… | …11000110010111 |
3 | 112002010020001001 |
4 | 30002213012113 |
5 | 403203323111 |
6 | 32013444131 |
7 | 5002031305 |
oct | 1402470627 |
9 | 462106031 |
10 | 202011031 |
11 | a4036972 |
12 | 577a0647 |
13 | 32b0c771 |
14 | 1cb87275 |
15 | 12b051c1 |
hex | c0a7197 |
202011031 has 4 divisors (see below), whose sum is σ = 202043232. Its totient is φ = 201978832.
The previous prime is 202011011. The next prime is 202011041. The reversal of 202011031 is 130110202.
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 202011031 - 25 = 202010999 is a prime.
It is a super-2 number, since 2×2020110312 = 81616913291365922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202010999 and 202011017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202011011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3295 + ... + 20368.
It is an arithmetic number, because the mean of its divisors is an integer number (50510808).
Almost surely, 2202011031 is an apocalyptic number.
202011031 is a deficient number, since it is larger than the sum of its proper divisors (32201).
202011031 is an equidigital number, since it uses as much as digits as its factorization.
202011031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32200.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 202011031 is about 14213.0584674798. The cubic root of 202011031 is about 586.7571111777.
Adding to 202011031 its reverse (130110202), we get a palindrome (332121233).
The spelling of 202011031 in words is "two hundred two million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •