Base | Representation |
---|---|
bin | 111110100111101… |
… | …1100010011111111 |
3 | 12102102210000200221 |
4 | 1331033130103333 |
5 | 13300401401002 |
6 | 544300002211 |
7 | 103032622615 |
oct | 17517342377 |
9 | 5372700627 |
10 | 2101200127 |
11 | 989088834 |
12 | 4a7830367 |
13 | 27641b1b0 |
14 | 15d0bd6b5 |
15 | c4702c37 |
hex | 7d3dc4ff |
2101200127 has 4 divisors (see below), whose sum is σ = 2262830920. Its totient is φ = 1939569336.
The previous prime is 2101200097. The next prime is 2101200137. The reversal of 2101200127 is 7210021012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2101200127 is a prime.
It is a super-2 number, since 2×21012001272 = 8830083947409632258, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2101200127.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101200137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80815377 + ... + 80815402.
It is an arithmetic number, because the mean of its divisors is an integer number (565707730).
Almost surely, 22101200127 is an apocalyptic number.
2101200127 is a deficient number, since it is larger than the sum of its proper divisors (161630793).
2101200127 is a wasteful number, since it uses less digits than its factorization.
2101200127 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161630792.
The product of its (nonzero) digits is 56, while the sum is 16.
The square root of 2101200127 is about 45838.8495383556. The cubic root of 2101200127 is about 1280.8230641873.
Adding to 2101200127 its reverse (7210021012), we get a palindrome (9311221139).
The spelling of 2101200127 in words is "two billion, one hundred one million, two hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •