Base | Representation |
---|---|
bin | 10011101110010001000… |
… | …000110010101011110001 |
3 | 11210120101111121221221022 |
4 | 103232101000302223301 |
5 | 134201222441232121 |
6 | 2514345454505225 |
7 | 166630530351110 |
oct | 23562100625361 |
9 | 4716344557838 |
10 | 1355347602161 |
11 | 482888429963 |
12 | 19a813205215 |
13 | 9aa68a1c6a7 |
14 | 498561c1c77 |
15 | 253c7ed4aab |
hex | 13b91032af1 |
1355347602161 has 8 divisors (see below), whose sum is σ = 1549010907840. Its totient is φ = 1161694851408.
The previous prime is 1355347602113. The next prime is 1355347602223. The reversal of 1355347602161 is 1612067435531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1355347602161 - 222 = 1355343407857 is a prime.
It is a super-3 number, since 3×13553476021613 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1355347601161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2361626 + ... + 2878883.
It is an arithmetic number, because the mean of its divisors is an integer number (193626363480).
Almost surely, 21355347602161 is an apocalyptic number.
It is an amenable number.
1355347602161 is a deficient number, since it is larger than the sum of its proper divisors (193663305679).
1355347602161 is an equidigital number, since it uses as much as digits as its factorization.
1355347602161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5277463.
The product of its (nonzero) digits is 453600, while the sum is 44.
The spelling of 1355347602161 in words is "one trillion, three hundred fifty-five billion, three hundred forty-seven million, six hundred two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •