Base | Representation |
---|---|
bin | 10011000111001000100… |
… | …101010010001100100101 |
3 | 11122112221020112221000110 |
4 | 103013020211102030211 |
5 | 133004200020223331 |
6 | 2443200253003233 |
7 | 163612355603565 |
oct | 23071045221445 |
9 | 4575836487013 |
10 | 1313330242341 |
11 | 466a867575a7 |
12 | 192647783519 |
13 | 96b00a252c0 |
14 | 477cbb1ada5 |
15 | 2426935b946 |
hex | 131c8952325 |
1313330242341 has 16 divisors (see below), whose sum is σ = 1895283958400. Its totient is φ = 804141898560.
The previous prime is 1313330242339. The next prime is 1313330242381. The reversal of 1313330242341 is 1432420333131.
It is not a de Polignac number, because 1313330242341 - 21 = 1313330242339 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1313330242299 and 1313330242308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313330242381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 84603130 + ... + 84618651.
It is an arithmetic number, because the mean of its divisors is an integer number (118455247400).
Almost surely, 21313330242341 is an apocalyptic number.
It is an amenable number.
1313330242341 is a deficient number, since it is larger than the sum of its proper divisors (581953716059).
1313330242341 is a wasteful number, since it uses less digits than its factorization.
1313330242341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169221996.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 1313330242341 its reverse (1432420333131), we get a palindrome (2745750575472).
The spelling of 1313330242341 in words is "one trillion, three hundred thirteen billion, three hundred thirty million, two hundred forty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •