Base | Representation |
---|---|
bin | 1011101010010101000… |
… | …1111010011110100111 |
3 | 201011010010202020110121 |
4 | 2322211101322132213 |
5 | 11240244401312411 |
6 | 232011404102411 |
7 | 20321435035153 |
oct | 2724521723647 |
9 | 634103666417 |
10 | 200341432231 |
11 | 77a675742a6 |
12 | 329b1b34a07 |
13 | 15b79c95695 |
14 | 99a759c063 |
15 | 5328419571 |
hex | 2ea547a7a7 |
200341432231 has 4 divisors (see below), whose sum is σ = 200554335864. Its totient is φ = 200128528600.
The previous prime is 200341432229. The next prime is 200341432241. The reversal of 200341432231 is 132234143002.
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 200341432231 - 21 = 200341432229 is a prime.
It is a super-2 number, since 2×2003414322312 (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 = 200341432196 and 200341432205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200341432201) 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, 106450405 + ... + 106452286.
It is an arithmetic number, because the mean of its divisors is an integer number (50138583966).
Almost surely, 2200341432231 is an apocalyptic number.
200341432231 is a deficient number, since it is larger than the sum of its proper divisors (212903633).
200341432231 is an equidigital number, since it uses as much as digits as its factorization.
200341432231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212903632.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 200341432231 its reverse (132234143002), we get a palindrome (332575575233).
The spelling of 200341432231 in words is "two hundred billion, three hundred forty-one million, four hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •