Base | Representation |
---|---|
bin | 10000100000011100101… |
… | …010110100011101100101 |
3 | 11000102221222002010011202 |
4 | 100200130222310131211 |
5 | 122041123200300000 |
6 | 2225040403412245 |
7 | 144645210624365 |
oct | 20403452643545 |
9 | 4012858063152 |
10 | 1134352353125 |
11 | 3a8092370382 |
12 | 163a18384085 |
13 | 82c79a90044 |
14 | 3cc8d9869a5 |
15 | 1e791750dd5 |
hex | 1081cab4765 |
1134352353125 has 24 divisors (see below), whose sum is σ = 1418034193128. Its totient is φ = 907363800000.
The previous prime is 1134352353097. The next prime is 1134352353131. The reversal of 1134352353125 is 5213532534311.
It can be written as a sum of positive squares in 12 ways, for example, as 1131757673281 + 2594679844 = 1063841^2 + 50938^2 .
It is not a de Polignac number, because 1134352353125 - 28 = 1134352352869 is a prime.
It is a super-2 number, since 2×11343523531252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 30171839 + ... + 30209411.
It is an arithmetic number, because the mean of its divisors is an integer number (59084758047).
Almost surely, 21134352353125 is an apocalyptic number.
It is an amenable number.
1134352353125 is a deficient number, since it is larger than the sum of its proper divisors (283681840003).
1134352353125 is an frugal number, since it uses more digits than its factorization.
1134352353125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47259 (or 47239 counting only the distinct ones).
The product of its digits is 162000, while the sum is 38.
Adding to 1134352353125 its reverse (5213532534311), we get a palindrome (6347884887436).
The spelling of 1134352353125 in words is "one trillion, one hundred thirty-four billion, three hundred fifty-two million, three hundred fifty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •