Base | Representation |
---|---|
bin | 10011101101111110101… |
… | …100100010010101001011 |
3 | 11210112121002101111221002 |
4 | 103231332230202111023 |
5 | 134200110304134121 |
6 | 2514255200205215 |
7 | 166620106346345 |
oct | 23557654422513 |
9 | 4715532344832 |
10 | 1355040302411 |
11 | 48273aa1a024 |
12 | 19a74830980b |
13 | 9aa1a167113 |
14 | 4982746c295 |
15 | 253ab032e0b |
hex | 13b7eb2254b |
1355040302411 has 12 divisors (see below), whose sum is σ = 1499841127512. Its totient is φ = 1219882821696.
The previous prime is 1355040302281. The next prime is 1355040302437. The reversal of 1355040302411 is 1142030405531.
It is a de Polignac number, because none of the positive numbers 2k-1355040302411 is a prime.
It is a super-2 number, since 2×13550403024112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1355040301411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 75329621 + ... + 75347606.
It is an arithmetic number, because the mean of its divisors is an integer number (124986760626).
Almost surely, 21355040302411 is an apocalyptic number.
1355040302411 is a deficient number, since it is larger than the sum of its proper divisors (144800825101).
1355040302411 is a wasteful number, since it uses less digits than its factorization.
1355040302411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150677290 (or 150677267 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 1355040302411 its reverse (1142030405531), we get a palindrome (2497070707942).
The spelling of 1355040302411 in words is "one trillion, three hundred fifty-five billion, forty million, three hundred two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •