Base | Representation |
---|---|
bin | 1011001110101100… |
… | …0010001110111001 |
3 | 21210002010112112121 |
4 | 2303223002032321 |
5 | 22133141344001 |
6 | 1215041041241 |
7 | 134462000641 |
oct | 26353021671 |
9 | 7702115477 |
10 | 3014403001 |
11 | 1307608655 |
12 | 701626221 |
13 | 39068821c |
14 | 2084b5521 |
15 | 12998b6a1 |
hex | b3ac23b9 |
3014403001 has 4 divisors (see below), whose sum is σ = 3014752500. Its totient is φ = 3014053504.
The previous prime is 3014402969. The next prime is 3014403011. The reversal of 3014403001 is 1003044103.
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 29419776 + 2984983225 = 5424^2 + 54635^2 .
It is a cyclic number.
It is not a de Polignac number, because 3014403001 - 25 = 3014402969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3014403011) 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, 161476 + ... + 179173.
It is an arithmetic number, because the mean of its divisors is an integer number (753688125).
Almost surely, 23014403001 is an apocalyptic number.
It is an amenable number.
3014403001 is a deficient number, since it is larger than the sum of its proper divisors (349499).
3014403001 is an equidigital number, since it uses as much as digits as its factorization.
3014403001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349498.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 3014403001 is about 54903.5791274121. The cubic root of 3014403001 is about 1444.5539666525.
Adding to 3014403001 its reverse (1003044103), we get a palindrome (4017447104).
The spelling of 3014403001 in words is "three billion, fourteen million, four hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •