Base | Representation |
---|---|
bin | 1100010001100101111… |
… | …0000001111001101011 |
3 | 202011022122020111220201 |
4 | 3010121132001321223 |
5 | 11423340424400021 |
6 | 240513253133031 |
7 | 21143551242322 |
oct | 3043136017153 |
9 | 664278214821 |
10 | 210880700011 |
11 | 81485726163 |
12 | 34a5362a177 |
13 | 16b696063c7 |
14 | a2c71b90b9 |
15 | 57437ea591 |
hex | 3119781e6b |
210880700011 has 8 divisors (see below), whose sum is σ = 213498977120. Its totient is φ = 208273401792.
The previous prime is 210880699999. The next prime is 210880700029. The reversal of 210880700011 is 110007088012.
210880700011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210880700011 - 29 = 210880699499 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210880700311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2706066 + ... + 2782903.
It is an arithmetic number, because the mean of its divisors is an integer number (26687372140).
Almost surely, 2210880700011 is an apocalyptic number.
210880700011 is a deficient number, since it is larger than the sum of its proper divisors (2618277109).
210880700011 is a wasteful number, since it uses less digits than its factorization.
210880700011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5489445.
The product of its (nonzero) digits is 896, while the sum is 28.
Adding to 210880700011 its reverse (110007088012), we get a palindrome (320887788023).
The spelling of 210880700011 in words is "two hundred ten billion, eight hundred eighty million, seven hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •