Base | Representation |
---|---|
bin | 100001100010100… |
… | …1101010001101001 |
3 | 2220102201012110222 |
4 | 1003011031101221 |
5 | 4301103013234 |
6 | 303402015425 |
7 | 36614033003 |
oct | 10305152151 |
9 | 2812635428 |
10 | 1125438569 |
11 | 52830a722 |
12 | 274aa7575 |
13 | 14c2196a8 |
14 | a9681373 |
15 | 68c0d42e |
hex | 4314d469 |
1125438569 has 8 divisors (see below), whose sum is σ = 1131278400. Its totient is φ = 1119610000.
The previous prime is 1125438563. The next prime is 1125438581. The reversal of 1125438569 is 9658345211.
It is a happy number.
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 1125438569 - 212 = 1125434473 is a prime.
It is a super-2 number, since 2×11254385692 = 2533223945185535522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1125438563) 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, 256607 + ... + 260955.
It is an arithmetic number, because the mean of its divisors is an integer number (141409800).
Almost surely, 21125438569 is an apocalyptic number.
It is an amenable number.
1125438569 is a deficient number, since it is larger than the sum of its proper divisors (5839831).
1125438569 is a wasteful number, since it uses less digits than its factorization.
1125438569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5631.
The product of its digits is 259200, while the sum is 44.
The square root of 1125438569 is about 33547.5568260939. The cubic root of 1125438569 is about 1040.1770436390.
The spelling of 1125438569 in words is "one billion, one hundred twenty-five million, four hundred thirty-eight thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •