Base | Representation |
---|---|
bin | 101101100001011101000001… |
… | …100010010000000111101111 |
3 | 222020212222120211100200200112 |
4 | 231201131001202100013233 |
5 | 202220224112000013012 |
6 | 1545451355203450235 |
7 | 60112524135610352 |
oct | 5541350142200757 |
9 | 866788524320615 |
10 | 200211000001007 |
11 | 58880010013076 |
12 | 1a55629698697b |
13 | 8793a7c505c98 |
14 | 376239a9b6299 |
15 | 1822e330a3122 |
hex | b617418901ef |
200211000001007 has 8 divisors (see below), whose sum is σ = 200743265226240. Its totient is φ = 199678784365600.
The previous prime is 200211000000923. The next prime is 200211000001037. The reversal of 200211000001007 is 700100000112002.
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 200211000001007 - 214 = 200210999984623 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211000000982 and 200211000001000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211000001037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4305032 + ... + 20468397.
It is an arithmetic number, because the mean of its divisors is an integer number (25092908153280).
Almost surely, 2200211000001007 is an apocalyptic number.
200211000001007 is a deficient number, since it is larger than the sum of its proper divisors (532265225233).
200211000001007 is a wasteful number, since it uses less digits than its factorization.
200211000001007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24794913.
The product of its (nonzero) digits is 28, while the sum is 14.
Adding to 200211000001007 its reverse (700100000112002), we get a palindrome (900311000113009).
The spelling of 200211000001007 in words is "two hundred trillion, two hundred eleven billion, one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •