Base | Representation |
---|---|
bin | 1011101101100001110… |
… | …1011110011010001111 |
3 | 201020022222111010120212 |
4 | 2323120131132122033 |
5 | 11244024211213012 |
6 | 232232520233035 |
7 | 20351632432523 |
oct | 2733035363217 |
9 | 636288433525 |
10 | 201200101007 |
11 | 78368236914 |
12 | 32bb160b77b |
13 | 15c85b4a609 |
14 | 9a49639d83 |
15 | 53789ceb22 |
hex | 2ed875e68f |
201200101007 has 8 divisors (see below), whose sum is σ = 201547201536. Its totient is φ = 200853113272.
The previous prime is 201200101001. The next prime is 201200101021. The reversal of 201200101007 is 700101002102.
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 201200101007 - 236 = 132480624271 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201200100982 and 201200101000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201200101001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4042958 + ... + 4092420.
It is an arithmetic number, because the mean of its divisors is an integer number (25193400192).
Almost surely, 2201200101007 is an apocalyptic number.
201200101007 is a deficient number, since it is larger than the sum of its proper divisors (347100529).
201200101007 is an equidigital number, since it uses as much as digits as its factorization.
201200101007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56397.
The product of its (nonzero) digits is 28, while the sum is 14.
Adding to 201200101007 its reverse (700101002102), we get a palindrome (901301103109).
The spelling of 201200101007 in words is "two hundred one billion, two hundred million, one hundred one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •