Base | Representation |
---|---|
bin | 10100000001101111010101… |
… | …11100011111010010001101 |
3 | 12202221012120010221012200011 |
4 | 22000313222330133102031 |
5 | 21233023403300124323 |
6 | 233355450235233221 |
7 | 12163542144311335 |
oct | 1200675274372215 |
9 | 182835503835604 |
10 | 44040241411213 |
11 | 1303a3a8171583 |
12 | 4b333638a8811 |
13 | 1b75c9146ba08 |
14 | ac37b80a80c5 |
15 | 5158c399820d |
hex | 280deaf1f48d |
44040241411213 has 4 divisors (see below), whose sum is σ = 44387014965760. Its totient is φ = 43693467856668.
The previous prime is 44040241411211. The next prime is 44040241411247. The reversal of 44040241411213 is 31211414204044.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 44040241411213 - 21 = 44040241411211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44040241411211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 173386777083 + ... + 173386777336.
It is an arithmetic number, because the mean of its divisors is an integer number (11096753741440).
Almost surely, 244040241411213 is an apocalyptic number.
It is an amenable number.
44040241411213 is a deficient number, since it is larger than the sum of its proper divisors (346773554547).
44040241411213 is a wasteful number, since it uses less digits than its factorization.
44040241411213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 346773554546.
The product of its (nonzero) digits is 12288, while the sum is 31.
Adding to 44040241411213 its reverse (31211414204044), we get a palindrome (75251655615257).
The spelling of 44040241411213 in words is "forty-four trillion, forty billion, two hundred forty-one million, four hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •