Base | Representation |
---|---|
bin | 100001100010010… |
… | …1000110110011001 |
3 | 2220102102121211001 |
4 | 1003010220312121 |
5 | 4301033224434 |
6 | 303354505001 |
7 | 36612542011 |
oct | 10304506631 |
9 | 2812377731 |
10 | 1125289369 |
11 | 528218616 |
12 | 274a35161 |
13 | 14c1967c9 |
14 | a9642c41 |
15 | 68bce114 |
hex | 43128d99 |
1125289369 has 8 divisors (see below), whose sum is σ = 1159407360. Its totient is φ = 1091595456.
The previous prime is 1125289327. The next prime is 1125289391. The reversal of 1125289369 is 9639825211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1125289369 - 217 = 1125158297 is a prime.
It is a super-2 number, since 2×11252893692 = 2532552327968836322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1125289309) 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, 100629 + ... + 111250.
It is an arithmetic number, because the mean of its divisors is an integer number (144925920).
Almost surely, 21125289369 is an apocalyptic number.
It is an amenable number.
1125289369 is a deficient number, since it is larger than the sum of its proper divisors (34117991).
1125289369 is a wasteful number, since it uses less digits than its factorization.
1125289369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212039.
The product of its digits is 233280, while the sum is 46.
The square root of 1125289369 is about 33545.3330435099. Note that the first 3 decimals coincide. The cubic root of 1125289369 is about 1040.1310759965.
The spelling of 1125289369 in words is "one billion, one hundred twenty-five million, two hundred eighty-nine thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •