Base | Representation |
---|---|
bin | 11101010011111111000… |
… | …101110111111011111001 |
3 | 21010120022201210000012122 |
4 | 131103333011313323321 |
5 | 231000314023040231 |
6 | 4141211243051025 |
7 | 265346560050320 |
oct | 35237705677371 |
9 | 7116281700178 |
10 | 2014324424441 |
11 | 7072a769599a |
12 | 286481210a75 |
13 | 117c47143274 |
14 | 6d6cb0970b7 |
15 | 375e584677b |
hex | 1d4ff177ef9 |
2014324424441 has 8 divisors (see below), whose sum is σ = 2305676457984. Its totient is φ = 1723870241280.
The previous prime is 2014324424417. The next prime is 2014324424447. The reversal of 2014324424441 is 1444244234102.
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 2014324424441 - 234 = 1997144555257 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2014324424447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 224457785 + ... + 224466758.
It is an arithmetic number, because the mean of its divisors is an integer number (288209557248).
Almost surely, 22014324424441 is an apocalyptic number.
It is an amenable number.
2014324424441 is a deficient number, since it is larger than the sum of its proper divisors (291352033543).
2014324424441 is an equidigital number, since it uses as much as digits as its factorization.
2014324424441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448925191.
The product of its (nonzero) digits is 98304, while the sum is 35.
Adding to 2014324424441 its reverse (1444244234102), we get a palindrome (3458568658543).
The spelling of 2014324424441 in words is "two trillion, fourteen billion, three hundred twenty-four million, four hundred twenty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •