Base | Representation |
---|---|
bin | 111011101000111… |
… | …1110100000101001 |
3 | 12011110121112221201 |
4 | 1313101332200221 |
5 | 13044301414233 |
6 | 530324404201 |
7 | 100406633545 |
oct | 16721764051 |
9 | 5143545851 |
10 | 2001201193 |
11 | 937698092 |
12 | 47a246661 |
13 | 25b7a8024 |
14 | 14dacca25 |
15 | baa4d77d |
hex | 7747e829 |
2001201193 has 2 divisors, whose sum is σ = 2001201194. Its totient is φ = 2001201192.
The previous prime is 2001201161. The next prime is 2001201199. The reversal of 2001201193 is 3911021002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1559697049 + 441504144 = 39493^2 + 21012^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001201193 - 25 = 2001201161 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2001201193.
It is not a weakly prime, because it can be changed into another prime (2001201199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000600596 + 1000600597.
It is an arithmetic number, because the mean of its divisors is an integer number (1000600597).
Almost surely, 22001201193 is an apocalyptic number.
It is an amenable number.
2001201193 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001201193 is an equidigital number, since it uses as much as digits as its factorization.
2001201193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
The square root of 2001201193 is about 44734.7872801470. The cubic root of 2001201193 is about 1260.1732341389.
Adding to 2001201193 its reverse (3911021002), we get a palindrome (5912222195).
The spelling of 2001201193 in words is "two billion, one million, two hundred one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •