Base | Representation |
---|---|
bin | 101000000101110… |
… | …1110111100000101 |
3 | 10110202022221100211 |
4 | 1100023232330011 |
5 | 10223341100000 |
6 | 341253235421 |
7 | 45223314526 |
oct | 12013567405 |
9 | 3422287324 |
10 | 1345253125 |
11 | 6303a6647 |
12 | 316632b71 |
13 | 185920888 |
14 | ca94084d |
15 | 7d17d7ba |
hex | 502eef05 |
1345253125 has 24 divisors (see below), whose sum is σ = 1704781512. Its totient is φ = 1061280000.
The previous prime is 1345253123. The next prime is 1345253137. The reversal of 1345253125 is 5213525431.
It can be written as a sum of positive squares in 12 ways, for example, as 1211457636 + 133795489 = 34806^2 + 11567^2 .
It is not a de Polignac number, because 1345253125 - 21 = 1345253123 is a prime.
It is a super-3 number, since 3×13452531253 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1345253123) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 225177 + ... + 231073.
It is an arithmetic number, because the mean of its divisors is an integer number (71032563).
Almost surely, 21345253125 is an apocalyptic number.
It is an amenable number.
1345253125 is a deficient number, since it is larger than the sum of its proper divisors (359528387).
1345253125 is an frugal number, since it uses more digits than its factorization.
1345253125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5995 (or 5975 counting only the distinct ones).
The product of its digits is 18000, while the sum is 31.
The square root of 1345253125 is about 36677.6924710375. The cubic root of 1345253125 is about 1103.9125478253.
Adding to 1345253125 its reverse (5213525431), we get a palindrome (6558778556).
The spelling of 1345253125 in words is "one billion, three hundred forty-five million, two hundred fifty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •