Base | Representation |
---|---|
bin | 1011111111101101… |
… | …1100001000110001 |
3 | 22022102001110202102 |
4 | 2333323130020301 |
5 | 23043311430001 |
6 | 1251304230145 |
7 | 142536542366 |
oct | 27773341061 |
9 | 8272043672 |
10 | 3220030001 |
11 | 1402694221 |
12 | 75a46b355 |
13 | 3c41627c6 |
14 | 22792046d |
15 | 13ca57e6b |
hex | bfedc231 |
3220030001 has 4 divisors (see below), whose sum is σ = 3237820404. Its totient is φ = 3202239600.
The previous prime is 3220029977. The next prime is 3220030007. The reversal of 3220030001 is 1000300223.
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 126000625 + 3094029376 = 11225^2 + 55624^2 .
It is a cyclic number.
It is not a de Polignac number, because 3220030001 - 226 = 3152921137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3220030007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8894930 + ... + 8895291.
It is an arithmetic number, because the mean of its divisors is an integer number (809455101).
Almost surely, 23220030001 is an apocalyptic number.
It is an amenable number.
3220030001 is a deficient number, since it is larger than the sum of its proper divisors (17790403).
3220030001 is a wasteful number, since it uses less digits than its factorization.
3220030001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17790402.
The product of its (nonzero) digits is 36, while the sum is 11.
The square root of 3220030001 is about 56745.3081849064. The cubic root of 3220030001 is about 1476.6808380226.
Adding to 3220030001 its reverse (1000300223), we get a palindrome (4220330224).
The spelling of 3220030001 in words is "three billion, two hundred twenty million, thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •