Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110000110110000010111 |
3 | 222020212222120220021000102221 |
4 | 231201131001212012300113 |
5 | 202220224112224324343 |
6 | 1545451355241243211 |
7 | 60112524150315526 |
oct | 5541350146066027 |
9 | 866788526230387 |
10 | 200211001011223 |
11 | 58880010643064 |
12 | 1a556297193507 |
13 | 8793a7c79aa47 |
14 | 376239ab9a4bd |
15 | 1822e332025ed |
hex | b61741986c17 |
200211001011223 has 4 divisors (see below), whose sum is σ = 200211158598640. Its totient is φ = 200210843423808.
The previous prime is 200211001011211. The next prime is 200211001011271. The reversal of 200211001011223 is 322110100112002.
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 200211001011223 - 229 = 200210464140311 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211001011197 and 200211001011206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211001011293) 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, 76872378 + ... + 79434151.
It is an arithmetic number, because the mean of its divisors is an integer number (50052789649660).
Almost surely, 2200211001011223 is an apocalyptic number.
200211001011223 is a deficient number, since it is larger than the sum of its proper divisors (157587417).
200211001011223 is a wasteful number, since it uses less digits than its factorization.
200211001011223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157587416.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 200211001011223 its reverse (322110100112002), we get a palindrome (522321101123225).
The spelling of 200211001011223 in words is "two hundred trillion, two hundred eleven billion, one million, eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •