Base | Representation |
---|---|
bin | 101111110000000100001010… |
… | …111110011011011111011111 |
3 | 1000112120212121121122210001122 |
4 | 233300010022332123133133 |
5 | 210011310414200311312 |
6 | 2022353451405401155 |
7 | 62143544212334111 |
oct | 5760041276333737 |
9 | 1015525547583048 |
10 | 210011200010207 |
11 | 60a09282474852 |
12 | 1b6796b1b691bb |
13 | 9024c8190087b |
14 | 39c084c4093b1 |
15 | 1942d173cdb72 |
hex | bf010af9b7df |
210011200010207 has 8 divisors (see below), whose sum is σ = 212176724583600. Its totient is φ = 207845684838144.
The previous prime is 210011200010191. The next prime is 210011200010219. The reversal of 210011200010207 is 702010002110012.
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 210011200010207 - 24 = 210011200010191 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210011200010107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48114644 + ... + 52297622.
It is an arithmetic number, because the mean of its divisors is an integer number (26522090572950).
Almost surely, 2210011200010207 is an apocalyptic number.
210011200010207 is a deficient number, since it is larger than the sum of its proper divisors (2165524573393).
210011200010207 is an equidigital number, since it uses as much as digits as its factorization.
210011200010207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4700665.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 210011200010207 its reverse (702010002110012), we get a palindrome (912021202120219).
The spelling of 210011200010207 in words is "two hundred ten trillion, eleven billion, two hundred million, ten thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •