Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …110110000000100010101 |
3 | 21002012100111221001101100 |
4 | 131012221112300010111 |
5 | 230232000240344242 |
6 | 4130442100420313 |
7 | 264331614623103 |
oct | 35065126600425 |
9 | 7065314831340 |
10 | 2000001106197 |
11 | 7012175369a6 |
12 | 2837443a7699 |
13 | 1167a3860a23 |
14 | 6cb2ca9ac73 |
15 | 3705814a54c |
hex | 1d1a95b0115 |
2000001106197 has 12 divisors (see below), whose sum is σ = 2888906446764. Its totient is φ = 1333326704640.
The previous prime is 2000001106189. The next prime is 2000001106199. The reversal of 2000001106197 is 7916011000002.
It can be written as a sum of positive squares in 2 ways, for example, as 995287564881 + 1004713541316 = 997641^2 + 1002354^2 .
It is not a de Polignac number, because 2000001106197 - 23 = 2000001106189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2000001106197.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000001106199) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1482547 + ... + 2489567.
It is an arithmetic number, because the mean of its divisors is an integer number (240742203897).
Almost surely, 22000001106197 is an apocalyptic number.
It is an amenable number.
2000001106197 is a deficient number, since it is larger than the sum of its proper divisors (888905340567).
2000001106197 is a wasteful number, since it uses less digits than its factorization.
2000001106197 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1227700 (or 1227697 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
Adding to 2000001106197 its reverse (7916011000002), we get a palindrome (9916012106199).
The spelling of 2000001106197 in words is "two trillion, one million, one hundred six thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •