Base | Representation |
---|---|
bin | 101101011110101101000001… |
… | …011101100110010001101011 |
3 | 222020012220210111120010200112 |
4 | 231132231001131212101223 |
5 | 202204130044134020021 |
6 | 1545224503023124535 |
7 | 60063054061146623 |
oct | 5536550135462153 |
9 | 866186714503615 |
10 | 200022020220011 |
11 | 5880795393a590 |
12 | 1a525735a4374b |
13 | 877bcc3370472 |
14 | 3757190349883 |
15 | 181d072363d5b |
hex | b5eb4176646b |
200022020220011 has 8 divisors (see below), whose sum is σ = 218823987100464. Its totient is φ = 181323077816320.
The previous prime is 200022020219941. The next prime is 200022020220023. The reversal of 200022020220011 is 110022020220002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200022020220011 - 222 = 200022016025707 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200022020220041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25756115126 + ... + 25756122891.
It is an arithmetic number, because the mean of its divisors is an integer number (27352998387558).
Almost surely, 2200022020220011 is an apocalyptic number.
200022020220011 is a deficient number, since it is larger than the sum of its proper divisors (18801966880453).
200022020220011 is a wasteful number, since it uses less digits than its factorization.
200022020220011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51512238381.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 200022020220011 its reverse (110022020220002), we get a palindrome (310044040440013).
Subtracting from 200022020220011 its reverse (110022020220002), we obtain a palindrome (90000000000009).
The spelling of 200022020220011 in words is "two hundred trillion, twenty-two billion, twenty million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •