Base | Representation |
---|---|
bin | 101101100001011101001001… |
… | …011101111111100000110011 |
3 | 222020212222221002210221002210 |
4 | 231201131021131333200303 |
5 | 202220224400033232011 |
6 | 1545451420320343203 |
7 | 60112530343135314 |
oct | 5541351135774063 |
9 | 866788832727083 |
10 | 200211133102131 |
11 | 588800791629a8 |
12 | 1a556313474b03 |
13 | 8793aa0c69148 |
14 | 37623b054260b |
15 | 1822e3eae56a6 |
hex | b6174977f833 |
200211133102131 has 16 divisors (see below), whose sum is σ = 274173144979104. Its totient is φ = 129861872135424.
The previous prime is 200211133102091. The next prime is 200211133102237. The reversal of 200211133102131 is 131201331112002.
It is not a de Polignac number, because 200211133102131 - 225 = 200211099547699 is a prime.
It is a super-2 number, since 2×2002111331021312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200211133102098 and 200211133102107.
It is not an unprimeable number, because it can be changed into a prime (200211133100131) 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, 30382020 + ... + 36379793.
It is an arithmetic number, because the mean of its divisors is an integer number (17135821561194).
Almost surely, 2200211133102131 is an apocalyptic number.
200211133102131 is a deficient number, since it is larger than the sum of its proper divisors (73962011876973).
200211133102131 is a wasteful number, since it uses less digits than its factorization.
200211133102131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66788870.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 200211133102131 its reverse (131201331112002), we get a palindrome (331412464214133).
The spelling of 200211133102131 in words is "two hundred trillion, two hundred eleven billion, one hundred thirty-three million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •