Base | Representation |
---|---|
bin | 101101100001011111010001… |
… | …010111001111000001001011 |
3 | 222020220012210222220100221012 |
4 | 231201133101113033001023 |
5 | 202220244032214011021 |
6 | 1545452434443234135 |
7 | 60112641006206231 |
oct | 5541372127170113 |
9 | 866805728810835 |
10 | 200213413032011 |
11 | 58881039115a75 |
12 | 1a55684ab1894b |
13 | 8794075404c92 |
14 | 3762549268951 |
15 | 1823024d5035b |
hex | b617d15cf04b |
200213413032011 has 16 divisors (see below), whose sum is σ = 206904137472000. Its totient is φ = 193537217808000.
The previous prime is 200213413032007. The next prime is 200213413032029. The reversal of 200213413032011 is 110230314312002.
It is a cyclic number.
It is not a de Polignac number, because 200213413032011 - 22 = 200213413032007 is a prime.
It is a super-2 number, since 2×2002134130320112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200213413032041) 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, 922963640 + ... + 923180538.
It is an arithmetic number, because the mean of its divisors is an integer number (12931508592000).
Almost surely, 2200213413032011 is an apocalyptic number.
200213413032011 is a deficient number, since it is larger than the sum of its proper divisors (6690724439989).
200213413032011 is a wasteful number, since it uses less digits than its factorization.
200213413032011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250250.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 200213413032011 its reverse (110230314312002), we get a palindrome (310443727344013).
The spelling of 200213413032011 in words is "two hundred trillion, two hundred thirteen billion, four hundred thirteen million, thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •