Base | Representation |
---|---|
bin | 100000010100001001111… |
… | …1101011000100000000001 |
3 | 120201120211222220120012121 |
4 | 1000220103331120200001 |
5 | 1040231321221323210 |
6 | 13240152545524241 |
7 | 635606215654543 |
oct | 100502375304001 |
9 | 16646758816177 |
10 | 4441331042305 |
11 | 1462615651873 |
12 | 5b8914943681 |
13 | 262a7b1a2811 |
14 | 114d66791693 |
15 | 7a7e115d6da |
hex | 40a13f58801 |
4441331042305 has 4 divisors (see below), whose sum is σ = 5329597250772. Its totient is φ = 3553064833840.
The previous prime is 4441331042303. The next prime is 4441331042311. The reversal of 4441331042305 is 5032401331444.
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 3288336144129 + 1152994898176 = 1813377^2 + 1073776^2 .
It is not a de Polignac number, because 4441331042305 - 21 = 4441331042303 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4441331042303) 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, 444133104226 + ... + 444133104235.
It is an arithmetic number, because the mean of its divisors is an integer number (1332399312693).
Almost surely, 24441331042305 is an apocalyptic number.
It is an amenable number.
4441331042305 is a deficient number, since it is larger than the sum of its proper divisors (888266208467).
4441331042305 is an equidigital number, since it uses as much as digits as its factorization.
4441331042305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888266208466.
The product of its (nonzero) digits is 69120, while the sum is 34.
Adding to 4441331042305 its reverse (5032401331444), we get a palindrome (9473732373749).
The spelling of 4441331042305 in words is "four trillion, four hundred forty-one billion, three hundred thirty-one million, forty-two thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •