Base | Representation |
---|---|
bin | 101101011110101100000101… |
… | …010100001011111111000101 |
3 | 222020012211012011202112210121 |
4 | 231132230011110023333011 |
5 | 202204121012321320234 |
6 | 1545224214534421541 |
7 | 60063020056015366 |
oct | 5536540524137705 |
9 | 866184164675717 |
10 | 200021011120069 |
11 | 58807486270897 |
12 | 1a5254b3b018b1 |
13 | 877bb922982c9 |
14 | 37570d630db6d |
15 | 181d0139864b4 |
hex | b5eb0550bfc5 |
200021011120069 has 2 divisors, whose sum is σ = 200021011120070. Its totient is φ = 200021011120068.
The previous prime is 200021011120067. The next prime is 200021011120123. The reversal of 200021011120069 is 960021110120002.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132909886109025 + 67111125011044 = 11528655^2 + 8192138^2 .
It is a cyclic number.
It is not a de Polignac number, because 200021011120069 - 21 = 200021011120067 is a prime.
It is a super-2 number, since 2×2000210111200692 (a number of 29 digits) contains 22 as substring.
Together with 200021011120067, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200021011120061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100010505560034 + 100010505560035.
It is an arithmetic number, because the mean of its divisors is an integer number (100010505560035).
Almost surely, 2200021011120069 is an apocalyptic number.
It is an amenable number.
200021011120069 is a deficient number, since it is larger than the sum of its proper divisors (1).
200021011120069 is an equidigital number, since it uses as much as digits as its factorization.
200021011120069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 200021011120069 in words is "two hundred trillion, twenty-one billion, eleven million, one hundred twenty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •