Base | Representation |
---|---|
bin | 10011000100001111111… |
… | …010110100110111011101 |
3 | 11122020221022212012202021 |
4 | 103010033322310313131 |
5 | 132431323404320123 |
6 | 2441525021100141 |
7 | 163442526062521 |
oct | 23041772646735 |
9 | 4566838765667 |
10 | 1310232104413 |
11 | 465736957731 |
12 | 191b220b7651 |
13 | 96728bcc9ab |
14 | 475b6489d81 |
15 | 2413737ec5d |
hex | 1310feb4ddd |
1310232104413 has 4 divisors (see below), whose sum is σ = 1310343369660. Its totient is φ = 1310120839168.
The previous prime is 1310232104381. The next prime is 1310232104443. The reversal of 1310232104413 is 3144012320131.
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 733766986404 + 576465118009 = 856602^2 + 759253^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310232104413 - 25 = 1310232104381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310232104443) 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, 55614958 + ... + 55638511.
It is an arithmetic number, because the mean of its divisors is an integer number (327585842415).
Almost surely, 21310232104413 is an apocalyptic number.
It is an amenable number.
1310232104413 is a deficient number, since it is larger than the sum of its proper divisors (111265247).
1310232104413 is a wasteful number, since it uses less digits than its factorization.
1310232104413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111265246.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1310232104413 its reverse (3144012320131), we get a palindrome (4454244424544).
The spelling of 1310232104413 in words is "one trillion, three hundred ten billion, two hundred thirty-two million, one hundred four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •