Base | Representation |
---|---|
bin | 10010111000001101110111… |
… | …11000010011000101000001 |
3 | 12102222200220210202101012210 |
4 | 21130012323320103011001 |
5 | 20420131143304412231 |
6 | 224143135014412333 |
7 | 11513200615241001 |
oct | 1134067370230501 |
9 | 172880823671183 |
10 | 41514011013441 |
11 | 12255aa1a4920a |
12 | 47a583a3610a9 |
13 | 1a219a6677b65 |
14 | a37408888001 |
15 | 4bed1c172a46 |
hex | 25c1bbe13141 |
41514011013441 has 16 divisors (see below), whose sum is σ = 56132478230400. Its totient is φ = 27285787482240.
The previous prime is 41514011013361. The next prime is 41514011013469. The reversal of 41514011013441 is 14431011041514.
It is not a de Polignac number, because 41514011013441 - 214 = 41514010997057 is a prime.
It is a super-2 number, since 2×415140110134412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41514011013399 and 41514011013408.
It is not an unprimeable number, because it can be changed into a prime (41514011003441) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12804541 + ... + 15715733.
It is an arithmetic number, because the mean of its divisors is an integer number (3508279889400).
Almost surely, 241514011013441 is an apocalyptic number.
It is an amenable number.
41514011013441 is a deficient number, since it is larger than the sum of its proper divisors (14618467216959).
41514011013441 is a wasteful number, since it uses less digits than its factorization.
41514011013441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2978216.
The product of its (nonzero) digits is 3840, while the sum is 30.
Adding to 41514011013441 its reverse (14431011041514), we get a palindrome (55945022054955).
The spelling of 41514011013441 in words is "forty-one trillion, five hundred fourteen billion, eleven million, thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •