Base | Representation |
---|---|
bin | 1001100011011111110100… |
… | …0110001101101101111101 |
3 | 1101012022101021012211010020 |
4 | 2120313331012031231331 |
5 | 2334110120433202141 |
6 | 34202044430202353 |
7 | 2132664425500221 |
oct | 230677506155575 |
9 | 41168337184106 |
10 | 10505441303421 |
11 | 3390372815299 |
12 | 12180370533b9 |
13 | 5b28746a835c |
14 | 284674c8a781 |
15 | 13340d5ee266 |
hex | 98dfd18db7d |
10505441303421 has 8 divisors (see below), whose sum is σ = 14007578014944. Its totient is φ = 7003466063760.
The previous prime is 10505441303419. The next prime is 10505441303501. The reversal of 10505441303421 is 12430314450501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10505441303421 - 21 = 10505441303419 is a prime.
It is a super-2 number, since 2×105054413034212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10505441308421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40216075 + ... + 40476456.
It is an arithmetic number, because the mean of its divisors is an integer number (1750947251868).
Almost surely, 210505441303421 is an apocalyptic number.
It is an amenable number.
10505441303421 is a deficient number, since it is larger than the sum of its proper divisors (3502136711523).
10505441303421 is an equidigital number, since it uses as much as digits as its factorization.
10505441303421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80735931.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 10505441303421 its reverse (12430314450501), we get a palindrome (22935755753922).
The spelling of 10505441303421 in words is "ten trillion, five hundred five billion, four hundred forty-one million, three hundred three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •