Base | Representation |
---|---|
bin | 10011000111001101100… |
… | …101101110001011010110 |
3 | 11122120011002121121022002 |
4 | 103013031211232023112 |
5 | 133004333021234110 |
6 | 2443212453235302 |
7 | 163614425601551 |
oct | 23071545561326 |
9 | 4576132547262 |
10 | 1313414243030 |
11 | 46701a11055a |
12 | 19266b932b32 |
13 | 96b15256656 |
14 | 477d8d45698 |
15 | 24271900aa5 |
hex | 131cd96e2d6 |
1313414243030 has 32 divisors (see below), whose sum is σ = 2372896221696. Its totient is φ = 523422640224.
The previous prime is 1313414243021. The next prime is 1313414243039. The reversal of 1313414243030 is 303424143131.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1313414243021) and next prime (1313414243039).
It is a junction number, because it is equal to n+sod(n) for n = 1313414242984 and 1313414243002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313414243039) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6927557 + ... + 7114623.
It is an arithmetic number, because the mean of its divisors is an integer number (74153006928).
Almost surely, 21313414243030 is an apocalyptic number.
1313414243030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1313414243030 is a deficient number, since it is larger than the sum of its proper divisors (1059481978666).
1313414243030 is a wasteful number, since it uses less digits than its factorization.
1313414243030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189668.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1313414243030 its reverse (303424143131), we get a palindrome (1616838386161).
The spelling of 1313414243030 in words is "one trillion, three hundred thirteen billion, four hundred fourteen million, two hundred forty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •