Base | Representation |
---|---|
bin | 100101010100010… |
… | …0100011011010001 |
3 | 10020021010202102212 |
4 | 1022220210123101 |
5 | 10031022231240 |
6 | 324125521505 |
7 | 43013043005 |
oct | 11250443321 |
9 | 3207122385 |
10 | 1252148945 |
11 | 592895043 |
12 | 2ab413295 |
13 | 16c552a48 |
14 | bc426705 |
15 | 74ddc165 |
hex | 4aa246d1 |
1252148945 has 8 divisors (see below), whose sum is σ = 1516364520. Its totient is φ = 992528640.
The previous prime is 1252148941. The next prime is 1252148951. The reversal of 1252148945 is 5498412521.
It can be written as a sum of positive squares in 4 ways, for example, as 564870289 + 687278656 = 23767^2 + 26216^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1252148945 - 22 = 1252148941 is a prime.
It is a super-2 number, since 2×12521489452 = 3135753960929226050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1252148941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1148216 + ... + 1149305.
It is an arithmetic number, because the mean of its divisors is an integer number (189545565).
Almost surely, 21252148945 is an apocalyptic number.
It is an amenable number.
1252148945 is a deficient number, since it is larger than the sum of its proper divisors (264215575).
1252148945 is a wasteful number, since it uses less digits than its factorization.
1252148945 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2297635.
The product of its digits is 115200, while the sum is 41.
The square root of 1252148945 is about 35385.7166806043. The cubic root of 1252148945 is about 1077.8342931615.
The spelling of 1252148945 in words is "one billion, two hundred fifty-two million, one hundred forty-eight thousand, nine hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •