Base | Representation |
---|---|
bin | 10011100001000010011… |
… | …011011111101011010001 |
3 | 11202012201122121110120001 |
4 | 103201002123133223101 |
5 | 133433130420101431 |
6 | 2504040240450001 |
7 | 165615543313444 |
oct | 23410233375321 |
9 | 4665648543501 |
10 | 1341144300241 |
11 | 477859aa2a09 |
12 | 197b0a619901 |
13 | 9961426b625 |
14 | 48ca9b0765b |
15 | 24d460e3e61 |
hex | 138426dfad1 |
1341144300241 has 8 divisors (see below), whose sum is σ = 1356046223400. Its totient is φ = 1326289610880.
The previous prime is 1341144300187. The next prime is 1341144300257. The reversal of 1341144300241 is 1420034411431.
It can be written as a sum of positive squares in 4 ways, for example, as 2587858641 + 1338556441600 = 50871^2 + 1156960^2 .
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 1341144300241 - 219 = 1341143775953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1341144300841) 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, 11751346 + ... + 11864923.
It is an arithmetic number, because the mean of its divisors is an integer number (169505777925).
Almost surely, 21341144300241 is an apocalyptic number.
It is an amenable number.
1341144300241 is a deficient number, since it is larger than the sum of its proper divisors (14901923159).
1341144300241 is a wasteful number, since it uses less digits than its factorization.
1341144300241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23616899.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 1341144300241 its reverse (1420034411431), we get a palindrome (2761178711672).
The spelling of 1341144300241 in words is "one trillion, three hundred forty-one billion, one hundred forty-four million, three hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •