Base | Representation |
---|---|
bin | 1011111011110110001… |
… | …0101010011011100111 |
3 | 201121020211102011020120 |
4 | 2332331202222123213 |
5 | 11324412110142211 |
6 | 234110132333023 |
7 | 20546111340501 |
oct | 2767542523347 |
9 | 647224364216 |
10 | 205043443431 |
11 | 79a5a750972 |
12 | 338a4774173 |
13 | 1644917ba28 |
14 | 9cd1c50d71 |
15 | 550110cd06 |
hex | 2fbd8aa6e7 |
205043443431 has 4 divisors (see below), whose sum is σ = 273391257912. Its totient is φ = 136695628952.
The previous prime is 205043443417. The next prime is 205043443469. The reversal of 205043443431 is 134344340502.
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 205043443431 - 213 = 205043435239 is a prime.
It is a super-2 number, since 2×2050434434312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 205043443392 and 205043443401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (205043443471) 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, 34173907236 + ... + 34173907241.
It is an arithmetic number, because the mean of its divisors is an integer number (68347814478).
Almost surely, 2205043443431 is an apocalyptic number.
205043443431 is a deficient number, since it is larger than the sum of its proper divisors (68347814481).
205043443431 is an equidigital number, since it uses as much as digits as its factorization.
205043443431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68347814480.
The product of its (nonzero) digits is 69120, while the sum is 33.
Adding to 205043443431 its reverse (134344340502), we get a palindrome (339387783933).
The spelling of 205043443431 in words is "two hundred five billion, forty-three million, four hundred forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •