Base | Representation |
---|---|
bin | 101101100011001110000000… |
… | …001111110010111111100011 |
3 | 222021022120201012210201112012 |
4 | 231203032000033302333203 |
5 | 202224221033132241003 |
6 | 1550023220540023135 |
7 | 60124350266105345 |
oct | 5543160017627743 |
9 | 867276635721465 |
10 | 200332311212003 |
11 | 58917502032443 |
12 | 1a5758b1831aab |
13 | 87a2343252139 |
14 | 37681c811b295 |
15 | 18261832108d8 |
hex | b633803f2fe3 |
200332311212003 has 2 divisors, whose sum is σ = 200332311212004. Its totient is φ = 200332311212002.
The previous prime is 200332311211993. The next prime is 200332311212009. The reversal of 200332311212003 is 300212113233002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200332311212003 - 26 = 200332311211939 is a prime.
It is a super-2 number, since 2×2003323112120032 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200332311212003.
It is not a weakly prime, because it can be changed into another prime (200332311212009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100166155606001 + 100166155606002.
It is an arithmetic number, because the mean of its divisors is an integer number (100166155606002).
Almost surely, 2200332311212003 is an apocalyptic number.
200332311212003 is a deficient number, since it is larger than the sum of its proper divisors (1).
200332311212003 is an equidigital number, since it uses as much as digits as its factorization.
200332311212003 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 200332311212003 its reverse (300212113233002), we get a palindrome (500544424445005).
The spelling of 200332311212003 in words is "two hundred trillion, three hundred thirty-two billion, three hundred eleven million, two hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •