Base | Representation |
---|---|
bin | 101101011110101101000000… |
… | …111110010100100101110111 |
3 | 222020012220202221010120220120 |
4 | 231132231000332110211313 |
5 | 202204130040034133421 |
6 | 1545224502131303023 |
7 | 60063053631361260 |
oct | 5536550076244567 |
9 | 866186687116816 |
10 | 200022012021111 |
11 | 5880794a24a635 |
12 | 1a52573314aa73 |
13 | 877bcc175c647 |
14 | 375718d213967 |
15 | 181d0717948c6 |
hex | b5eb40f94977 |
200022012021111 has 16 divisors (see below), whose sum is σ = 304824605881344. Its totient is φ = 114287357961504.
The previous prime is 200022012021079. The next prime is 200022012021131. The reversal of 200022012021111 is 111120210220002.
It is not a de Polignac number, because 200022012021111 - 25 = 200022012021079 is a prime.
It is a super-2 number, since 2×2000220120211112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200022012021131) 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, 455384511 + ... + 455823536.
It is an arithmetic number, because the mean of its divisors is an integer number (19051537867584).
Almost surely, 2200022012021111 is an apocalyptic number.
200022012021111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
200022012021111 is a deficient number, since it is larger than the sum of its proper divisors (104802593860233).
200022012021111 is a wasteful number, since it uses less digits than its factorization.
200022012021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 911218510.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200022012021111 its reverse (111120210220002), we get a palindrome (311142222241113).
The spelling of 200022012021111 in words is "two hundred trillion, twenty-two billion, twelve million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •