Base | Representation |
---|---|
bin | 100001100010100… |
… | …0111011010100001 |
3 | 2220102122222112210 |
4 | 1003011013122201 |
5 | 4301101231221 |
6 | 303401312333 |
7 | 36613603005 |
oct | 10305073241 |
9 | 2812588483 |
10 | 1125414561 |
11 | 5282a3687 |
12 | 274a956a9 |
13 | 14c20b79b |
14 | a9676705 |
15 | 68c06276 |
hex | 431476a1 |
1125414561 has 8 divisors (see below), whose sum is σ = 1528865280. Its totient is φ = 736120112.
The previous prime is 1125414547. The next prime is 1125414599. The reversal of 1125414561 is 1654145211.
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 1125414561 - 25 = 1125414529 is a prime.
It is a super-2 number, since 2×11254145612 = 2533115868221645442, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1125414461) 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, 3538881 + ... + 3539198.
It is an arithmetic number, because the mean of its divisors is an integer number (191108160).
Almost surely, 21125414561 is an apocalyptic number.
It is an amenable number.
1125414561 is a deficient number, since it is larger than the sum of its proper divisors (403450719).
1125414561 is an equidigital number, since it uses as much as digits as its factorization.
1125414561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7078135.
The product of its digits is 4800, while the sum is 30.
The square root of 1125414561 is about 33547.1990037917. The cubic root of 1125414561 is about 1040.1696471897.
Adding to 1125414561 its reverse (1654145211), we get a palindrome (2779559772).
The spelling of 1125414561 in words is "one billion, one hundred twenty-five million, four hundred fourteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •