Base | Representation |
---|---|
bin | 101101011110101110001000… |
… | …100100011111110110000011 |
3 | 222020020000212122101100200101 |
4 | 231132232020210133312003 |
5 | 202204140020040223021 |
6 | 1545225221241103231 |
7 | 60063125455333531 |
oct | 5536561044376603 |
9 | 866200778340611 |
10 | 200023213211011 |
11 | 58808406299363 |
12 | 1a525a09487b17 |
13 | 877c15357c5b8 |
14 | 3757264973151 |
15 | 181d0e1e67a91 |
hex | b5eb8891fd83 |
200023213211011 has 16 divisors (see below), whose sum is σ = 212258948728320. Its totient is φ = 188082444813120.
The previous prime is 200023213210979. The next prime is 200023213211071. The reversal of 200023213211011 is 110112312320002.
It is not a de Polignac number, because 200023213211011 - 25 = 200023213210979 is a prime.
It is a super-3 number, since 3×2000232132110113 (a number of 44 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200023213211011.
It is not an unprimeable number, because it can be changed into a prime (200023213211071) 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, 241054471 + ... + 241882831.
It is an arithmetic number, because the mean of its divisors is an integer number (13266184295520).
Almost surely, 2200023213211011 is an apocalyptic number.
200023213211011 is a deficient number, since it is larger than the sum of its proper divisors (12235735517309).
200023213211011 is a wasteful number, since it uses less digits than its factorization.
200023213211011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1006386.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 200023213211011 its reverse (110112312320002), we get a palindrome (310135525531013).
The spelling of 200023213211011 in words is "two hundred trillion, twenty-three billion, two hundred thirteen million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •