Base | Representation |
---|---|
bin | 1011101001110110010… |
… | …1010100010110100111 |
3 | 201010210010202201000200 |
4 | 2322131211110112213 |
5 | 11240013322114343 |
6 | 231550512241543 |
7 | 20315306324004 |
oct | 2723545242647 |
9 | 633703681020 |
10 | 200212301223 |
11 | 77a00696260 |
12 | 329768402b3 |
13 | 15b592c25bc |
14 | 99943868ab |
15 | 531be0d4d3 |
hex | 2e9d9545a7 |
200212301223 has 12 divisors (see below), whose sum is σ = 315486050568. Its totient is φ = 121340788560.
The previous prime is 200212301221. The next prime is 200212301239. The reversal of 200212301223 is 322103212002.
200212301223 is a `hidden beast` number, since 200 + 212 + 30 + 1 + 223 = 666.
It is not a de Polignac number, because 200212301223 - 21 = 200212301221 is a prime.
It is a super-2 number, since 2×2002123012232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200212301196 and 200212301205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200212301221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1011173140 + ... + 1011173337.
It is an arithmetic number, because the mean of its divisors is an integer number (26290504214).
Almost surely, 2200212301223 is an apocalyptic number.
200212301223 is a deficient number, since it is larger than the sum of its proper divisors (115273749345).
200212301223 is a wasteful number, since it uses less digits than its factorization.
200212301223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2022346494 (or 2022346491 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 200212301223 its reverse (322103212002), we get a palindrome (522315513225).
The spelling of 200212301223 in words is "two hundred billion, two hundred twelve million, three hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.255 sec. • engine limits •