Base | Representation |
---|---|
bin | 10011101110001010000… |
… | …001101111010110001101 |
3 | 11210120002100002222200112 |
4 | 103232022001233112031 |
5 | 134201002441111000 |
6 | 2514330111005405 |
7 | 166624605263264 |
oct | 23561201572615 |
9 | 4716070088615 |
10 | 1355230410125 |
11 | 482828265839 |
12 | 19a79bb09865 |
13 | 9aa4a6698a7 |
14 | 498447d75db |
15 | 253bca86235 |
hex | 13b8a06f58d |
1355230410125 has 16 divisors (see below), whose sum is σ = 1691419167984. Its totient is φ = 1084125600000.
The previous prime is 1355230410101. The next prime is 1355230410143. The reversal of 1355230410125 is 5210140325531.
It can be written as a sum of positive squares in 8 ways, for example, as 861041093929 + 494189316196 = 927923^2 + 702986^2 .
It is not a de Polignac number, because 1355230410125 - 212 = 1355230406029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1355230410091 and 1355230410100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2101025 + ... + 2669225.
It is an arithmetic number, because the mean of its divisors is an integer number (105713697999).
Almost surely, 21355230410125 is an apocalyptic number.
It is an amenable number.
1355230410125 is a deficient number, since it is larger than the sum of its proper divisors (336188757859).
1355230410125 is an equidigital number, since it uses as much as digits as its factorization.
1355230410125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 587297 (or 587287 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 1355230410125 its reverse (5210140325531), we get a palindrome (6565370735656).
The spelling of 1355230410125 in words is "one trillion, three hundred fifty-five billion, two hundred thirty million, four hundred ten thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •