Base | Representation |
---|---|
bin | 111011101000101… |
… | …1000001011101001 |
3 | 12011110022120121012 |
4 | 1313101120023221 |
5 | 13044231403301 |
6 | 530321153305 |
7 | 100405411052 |
oct | 16721301351 |
9 | 5143276535 |
10 | 2001044201 |
11 | 9375a0142 |
12 | 47a18b835 |
13 | 25b751730 |
14 | 14da8b729 |
15 | baa1bebb |
hex | 774582e9 |
2001044201 has 4 divisors (see below), whose sum is σ = 2154970692. Its totient is φ = 1847117712.
The previous prime is 2001044197. The next prime is 2001044207. The reversal of 2001044201 is 1024401002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 763693225 + 1237350976 = 27635^2 + 35176^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001044201 - 22 = 2001044197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2001044207) 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, 76963226 + ... + 76963251.
It is an arithmetic number, because the mean of its divisors is an integer number (538742673).
Almost surely, 22001044201 is an apocalyptic number.
It is an amenable number.
2001044201 is a deficient number, since it is larger than the sum of its proper divisors (153926491).
2001044201 is a wasteful number, since it uses less digits than its factorization.
2001044201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153926490.
The product of its (nonzero) digits is 64, while the sum is 14.
The square root of 2001044201 is about 44733.0325486659. The cubic root of 2001044201 is about 1260.1402802159.
Adding to 2001044201 its reverse (1024401002), we get a palindrome (3025445203).
It can be divided in two parts, 200 and 1044201, that added together give a palindrome (1044401).
The spelling of 2001044201 in words is "two billion, one million, forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •