Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100110000110101100111010 |
3 | 222020212222120220021000010202 |
4 | 231201131001212012230322 |
5 | 202220224112224323002 |
6 | 1545451355241242202 |
7 | 60112524150315062 |
oct | 5541350146065472 |
9 | 866788526230122 |
10 | 200211001011002 |
11 | 58880010642983 |
12 | 1a556297193362 |
13 | 8793a7c79a907 |
14 | 376239ab9a3a2 |
15 | 1822e33202502 |
hex | b61741986b3a |
200211001011002 has 4 divisors (see below), whose sum is σ = 300316501516506. Its totient is φ = 100105500505500.
The previous prime is 200211001010939. The next prime is 200211001011011. The reversal of 200211001011002 is 200110100112002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 180525531688441 + 19685469322561 = 13435979^2 + 4436831^2 .
It is a super-2 number, since 2×2002110010110022 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50052750252749 + ... + 50052750252752.
Almost surely, 2200211001011002 is an apocalyptic number.
200211001011002 is a deficient number, since it is larger than the sum of its proper divisors (100105500505504).
200211001011002 is a wasteful number, since it uses less digits than its factorization.
200211001011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100105500505503.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200211001011002 its reverse (200110100112002), we get a palindrome (400321101123004).
The spelling of 200211001011002 in words is "two hundred trillion, two hundred eleven billion, one million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •