Base | Representation |
---|---|
bin | 1001011001111011001111… |
… | …1001100110110101111001 |
3 | 1100121120221101100221010011 |
4 | 2112132303321212311321 |
5 | 2323411334123120231 |
6 | 33554331503021521 |
7 | 2115053505662062 |
oct | 226366371466571 |
9 | 40546841327104 |
10 | 10341004504441 |
11 | 33276604a9416 |
12 | 11b01a559a8a1 |
13 | 5a01ca192bc0 |
14 | 27a715ddd569 |
15 | 12ded73a99b1 |
hex | 967b3e66d79 |
10341004504441 has 4 divisors (see below), whose sum is σ = 11136466389412. Its totient is φ = 9545542619472.
The previous prime is 10341004504381. The next prime is 10341004504483. The reversal of 10341004504441 is 14440540014301.
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 2802932246416 + 7538072258025 = 1674196^2 + 2745555^2 .
It is a cyclic number.
It is not a de Polignac number, because 10341004504441 - 215 = 10341004471673 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10341004504141) 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, 397730942466 + ... + 397730942491.
It is an arithmetic number, because the mean of its divisors is an integer number (2784116597353).
Almost surely, 210341004504441 is an apocalyptic number.
It is an amenable number.
10341004504441 is a deficient number, since it is larger than the sum of its proper divisors (795461884971).
10341004504441 is an equidigital number, since it uses as much as digits as its factorization.
10341004504441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 795461884970.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 10341004504441 its reverse (14440540014301), we get a palindrome (24781544518742).
The spelling of 10341004504441 in words is "ten trillion, three hundred forty-one billion, four million, five hundred four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •