Base | Representation |
---|---|
bin | 1011110000100111111… |
… | …1010000101011001111 |
3 | 201022110220001021021201 |
4 | 2330021333100223033 |
5 | 11302224421304411 |
6 | 232451202210331 |
7 | 20411342342005 |
oct | 2741177205317 |
9 | 638426037251 |
10 | 202031041231 |
11 | 7875428a578 |
12 | 331a39539a7 |
13 | 16089044416 |
14 | 9ac7b3aa75 |
15 | 53c69193c1 |
hex | 2f09fd0acf |
202031041231 has 4 divisors (see below), whose sum is σ = 202418817264. Its totient is φ = 201643265200.
The previous prime is 202031041229. The next prime is 202031041279. The reversal of 202031041231 is 132140130202.
It is a happy number.
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 202031041231 - 21 = 202031041229 is a prime.
It is a super-2 number, since 2×2020310412312 (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 = 202031041199 and 202031041208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202031041031) 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, 193887235 + ... + 193888276.
It is an arithmetic number, because the mean of its divisors is an integer number (50604704316).
Almost surely, 2202031041231 is an apocalyptic number.
202031041231 is a deficient number, since it is larger than the sum of its proper divisors (387776033).
202031041231 is an equidigital number, since it uses as much as digits as its factorization.
202031041231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 387776032.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 202031041231 its reverse (132140130202), we get a palindrome (334171171433).
The spelling of 202031041231 in words is "two hundred two billion, thirty-one million, forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •