Base | Representation |
---|---|
bin | 111011101001001… |
… | …0111011010100001 |
3 | 12011110210201212210 |
4 | 1313102113122201 |
5 | 13044313200301 |
6 | 530330512333 |
7 | 100410540132 |
oct | 16722273241 |
9 | 5143721783 |
10 | 2001303201 |
11 | 937757797 |
12 | 47a2956a9 |
13 | 25b8125a1 |
14 | 14db17c89 |
15 | baa6dad6 |
hex | 774976a1 |
2001303201 has 4 divisors (see below), whose sum is σ = 2668404272. Its totient is φ = 1334202132.
The previous prime is 2001303173. The next prime is 2001303203. The reversal of 2001303201 is 1023031002.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2001303201 - 211 = 2001301153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2001303203) 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 in 3 ways as a sum of consecutive naturals, for example, 333550531 + ... + 333550536.
It is an arithmetic number, because the mean of its divisors is an integer number (667101068).
Almost surely, 22001303201 is an apocalyptic number.
It is an amenable number.
2001303201 is a deficient number, since it is larger than the sum of its proper divisors (667101071).
2001303201 is an equidigital number, since it uses as much as digits as its factorization.
2001303201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667101070.
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 2001303201 is about 44735.9274073982. The cubic root of 2001303201 is about 1260.1946455405.
Adding to 2001303201 its reverse (1023031002), we get a palindrome (3024334203).
The spelling of 2001303201 in words is "two billion, one million, three hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •