Base | Representation |
---|---|
bin | 10011010001011110111… |
… | …110010010001111101011 |
3 | 11200121121201202102012220 |
4 | 103101132332102033223 |
5 | 133144424442010011 |
6 | 2452235120405123 |
7 | 164454640261101 |
oct | 23213676221753 |
9 | 4617551672186 |
10 | 1324443313131 |
11 | 4707697a4124 |
12 | 1948294767a3 |
13 | 97b821bb933 |
14 | 48163a21c71 |
15 | 246b9cd3506 |
hex | 1345ef923eb |
1324443313131 has 8 divisors (see below), whose sum is σ = 1766409176640. Its totient is φ = 882719829192.
The previous prime is 1324443313099. The next prime is 1324443313147. The reversal of 1324443313131 is 1313133444231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1324443313131 - 25 = 1324443313099 is a prime.
It is a super-2 number, since 2×13244433131312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1324443313092 and 1324443313101.
It is not an unprimeable number, because it can be changed into a prime (1324443313031) 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, 60582141 + ... + 60603998.
It is an arithmetic number, because the mean of its divisors is an integer number (220801147080).
Almost surely, 21324443313131 is an apocalyptic number.
1324443313131 is a deficient number, since it is larger than the sum of its proper divisors (441965863509).
1324443313131 is a wasteful number, since it uses less digits than its factorization.
1324443313131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121189785.
The product of its digits is 31104, while the sum is 33.
Adding to 1324443313131 its reverse (1313133444231), we get a palindrome (2637576757362).
The spelling of 1324443313131 in words is "one trillion, three hundred twenty-four billion, four hundred forty-three million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •