Base | Representation |
---|---|
bin | 101101100001100110100010… |
… | …001010111101100011111111 |
3 | 222020220221221110120101002211 |
4 | 231201212202022331203333 |
5 | 202220411020033021343 |
6 | 1545500204333401251 |
7 | 60113335156544644 |
oct | 5541464212754377 |
9 | 866827843511084 |
10 | 200221211220223 |
11 | 5888437aa83216 |
12 | 1a558266639227 |
13 | 8794a18ba822b |
14 | 3762a88bdbdcb |
15 | 182332e78479d |
hex | b619a22bd8ff |
200221211220223 has 16 divisors (see below), whose sum is σ = 208191587766624. Its totient is φ = 192398550474240.
The previous prime is 200221211220181. The next prime is 200221211220313. The reversal of 200221211220223 is 322022112122002.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200221211220223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200221211220194 and 200221211220203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200221211220923) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17807611 + ... + 26787187.
It is an arithmetic number, because the mean of its divisors is an integer number (13011974235414).
Almost surely, 2200221211220223 is an apocalyptic number.
200221211220223 is a deficient number, since it is larger than the sum of its proper divisors (7970376546401).
200221211220223 is an equidigital number, since it uses as much as digits as its factorization.
200221211220223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8987802.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 200221211220223 its reverse (322022112122002), we get a palindrome (522243323342225).
The spelling of 200221211220223 in words is "two hundred trillion, two hundred twenty-one billion, two hundred eleven million, two hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •