Base | Representation |
---|---|
bin | 1011101001110110010… |
… | …1000011010000111111 |
3 | 201010210010122011000101 |
4 | 2322131211003100333 |
5 | 11240013312344411 |
6 | 231550510541531 |
7 | 20315305612645 |
oct | 2723545032077 |
9 | 633703564011 |
10 | 200212231231 |
11 | 77a00648711 |
12 | 329768078a7 |
13 | 15b5929979c |
14 | 9994369195 |
15 | 531bde78c1 |
hex | 2e9d94343f |
200212231231 has 4 divisors (see below), whose sum is σ = 202624426872. Its totient is φ = 197800035592.
The previous prime is 200212231223. The next prime is 200212231253. The reversal of 200212231231 is 132132212002.
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 200212231231 - 23 = 200212231223 is a prime.
It is a super-2 number, since 2×2002122312312 (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 = 200212231199 and 200212231208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200212231631) 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, 1206097696 + ... + 1206097861.
It is an arithmetic number, because the mean of its divisors is an integer number (50656106718).
Almost surely, 2200212231231 is an apocalyptic number.
200212231231 is a deficient number, since it is larger than the sum of its proper divisors (2412195641).
200212231231 is an equidigital number, since it uses as much as digits as its factorization.
200212231231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2412195640.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 200212231231 its reverse (132132212002), we get a palindrome (332344443233).
The spelling of 200212231231 in words is "two hundred billion, two hundred twelve million, two hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •