Base | Representation |
---|---|
bin | 10011000110011001001… |
… | …101110000010100111111 |
3 | 11122110212212012010102012 |
4 | 103012121031300110333 |
5 | 133001033044421101 |
6 | 2442545343521435 |
7 | 163553566024265 |
oct | 23063115602477 |
9 | 4573785163365 |
10 | 1312535545151 |
11 | 466709108866 |
12 | 1924655b927b |
13 | 96a051aac8c |
14 | 47754372435 |
15 | 2421e6d0bbb |
hex | 1319937053f |
1312535545151 has 4 divisors (see below), whose sum is σ = 1312979422152. Its totient is φ = 1312091668152.
The previous prime is 1312535545141. The next prime is 1312535545163. The reversal of 1312535545151 is 1515455352131.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1312535545151 is a prime.
It is a super-2 number, since 2×13125355451512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1312535545099 and 1312535545108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312535545141) 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, 221934065 + ... + 221939978.
It is an arithmetic number, because the mean of its divisors is an integer number (328244855538).
Almost surely, 21312535545151 is an apocalyptic number.
1312535545151 is a deficient number, since it is larger than the sum of its proper divisors (443877001).
1312535545151 is an equidigital number, since it uses as much as digits as its factorization.
1312535545151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443877000.
The product of its digits is 225000, while the sum is 41.
The spelling of 1312535545151 in words is "one trillion, three hundred twelve billion, five hundred thirty-five million, five hundred forty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •