Base | Representation |
---|---|
bin | 111100000010001… |
… | …1001110100010001 |
3 | 12012101111011002002 |
4 | 1320010121310101 |
5 | 13111142421431 |
6 | 531520003345 |
7 | 100630201211 |
oct | 17004316421 |
9 | 5171434062 |
10 | 2014420241 |
11 | 9440a6819 |
12 | 482760555 |
13 | 261455b52 |
14 | 151770241 |
15 | bbcb03cb |
hex | 78119d11 |
2014420241 has 8 divisors (see below), whose sum is σ = 2064147624. Its totient is φ = 1964721280.
The previous prime is 2014420229. The next prime is 2014420249. The reversal of 2014420241 is 1420244102.
It can be written as a sum of positive squares in 4 ways, for example, as 16777216 + 1997643025 = 4096^2 + 44695^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2014420241 - 210 = 2014419217 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2014420249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 244115 + ... + 252231.
It is an arithmetic number, because the mean of its divisors is an integer number (258018453).
Almost surely, 22014420241 is an apocalyptic number.
It is an amenable number.
2014420241 is a deficient number, since it is larger than the sum of its proper divisors (49727383).
2014420241 is an equidigital number, since it uses as much as digits as its factorization.
2014420241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14211.
The product of its (nonzero) digits is 512, while the sum is 20.
The square root of 2014420241 is about 44882.2931789364. The cubic root of 2014420241 is about 1262.9418622088.
Adding to 2014420241 its reverse (1420244102), we get a palindrome (3434664343).
The spelling of 2014420241 in words is "two billion, fourteen million, four hundred twenty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •