Base | Representation |
---|---|
bin | 101101011110011010100110… |
… | …011110001000111000101111 |
3 | 222020011000201222122001222101 |
4 | 231132122212132020320233 |
5 | 202203314041421232421 |
6 | 1545211432144555531 |
7 | 60061453645232200 |
oct | 5536324636107057 |
9 | 866130658561871 |
10 | 200002240024111 |
11 | 587aa52349a648 |
12 | 1a521935622ba7 |
13 | 877a190395035 |
14 | 375623531d5a7 |
15 | 181c7b5a65191 |
hex | b5e6a6788e2f |
200002240024111 has 48 divisors (see below), whose sum is σ = 235633339798560. Its totient is φ = 169248544174080.
The previous prime is 200002240024073. The next prime is 200002240024129. The reversal of 200002240024111 is 111420042200002.
It is not a de Polignac number, because 200002240024111 - 219 = 200002239499823 is a prime.
It is a super-2 number, since 2×2000022400241112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200002240124111) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10287642151 + ... + 10287661591.
It is an arithmetic number, because the mean of its divisors is an integer number (4909027912470).
Almost surely, 2200002240024111 is an apocalyptic number.
200002240024111 is a deficient number, since it is larger than the sum of its proper divisors (35631099774449).
200002240024111 is a wasteful number, since it uses less digits than its factorization.
200002240024111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26744 (or 26737 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 200002240024111 its reverse (111420042200002), we get a palindrome (311422282224113).
The spelling of 200002240024111 in words is "two hundred trillion, two billion, two hundred forty million, twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •