Base | Representation |
---|---|
bin | 1100000110001110100100… |
… | …1100111110011111100001 |
3 | 1202002120112201001120112202 |
4 | 3001203221030332133201 |
5 | 3220411204044211231 |
6 | 44142242204102545 |
7 | 2541655301046041 |
oct | 301435114763741 |
9 | 52076481046482 |
10 | 13301131241441 |
11 | 4268a8390a47a |
12 | 15a9a21b34a55 |
13 | 7563a2c85a54 |
14 | 33dac74b9721 |
15 | 180ed62ed5cb |
hex | c18e933e7e1 |
13301131241441 has 8 divisors (see below), whose sum is σ = 13306502589984. Its totient is φ = 13295760660000.
The previous prime is 13301131241401. The next prime is 13301131241467. The reversal of 13301131241441 is 14414213110331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13301131241441 - 234 = 13283951372257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13301131241401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35852405 + ... + 36221501.
It is an arithmetic number, because the mean of its divisors is an integer number (1663312823748).
Almost surely, 213301131241441 is an apocalyptic number.
It is an amenable number.
13301131241441 is a deficient number, since it is larger than the sum of its proper divisors (5371348543).
13301131241441 is a wasteful number, since it uses less digits than its factorization.
13301131241441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383551.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 13301131241441 its reverse (14414213110331), we get a palindrome (27715344351772).
The spelling of 13301131241441 in words is "thirteen trillion, three hundred one billion, one hundred thirty-one million, two hundred forty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •