Base | Representation |
---|---|
bin | 1011110010001001100… |
… | …0010010001111011111 |
3 | 201100112102001110021011 |
4 | 2330202120102033133 |
5 | 11304044201120211 |
6 | 232555541120051 |
7 | 20424441525262 |
oct | 2744230221737 |
9 | 640472043234 |
10 | 202440254431 |
11 | 789442784a8 |
12 | 332989b9027 |
13 | 16122a603cc |
14 | 9b2621ccd9 |
15 | 53ec7ec921 |
hex | 2f226123df |
202440254431 has 4 divisors (see below), whose sum is σ = 202486028752. Its totient is φ = 202394480112.
The previous prime is 202440254417. The next prime is 202440254447. The reversal of 202440254431 is 134452044202.
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 202440254431 - 217 = 202440123359 is a prime.
It is a super-2 number, since 2×2024402544312 (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 = 202440254393 and 202440254402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202440254411) 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, 22880526 + ... + 22889371.
It is an arithmetic number, because the mean of its divisors is an integer number (50621507188).
Almost surely, 2202440254431 is an apocalyptic number.
202440254431 is a deficient number, since it is larger than the sum of its proper divisors (45774321).
202440254431 is an equidigital number, since it uses as much as digits as its factorization.
202440254431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45774320.
The product of its (nonzero) digits is 30720, while the sum is 31.
Adding to 202440254431 its reverse (134452044202), we get a palindrome (336892298633).
The spelling of 202440254431 in words is "two hundred two billion, four hundred forty million, two hundred fifty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •