Base | Representation |
---|---|
bin | 100001100001110… |
… | …1111101111101101 |
3 | 2220101222201222002 |
4 | 1003003233233231 |
5 | 4301003233334 |
6 | 303345502045 |
7 | 36610546046 |
oct | 10303575755 |
9 | 2811881862 |
10 | 1125055469 |
11 | 52807890a |
12 | 274941925 |
13 | 14c1141c5 |
14 | a95c18cd |
15 | 68b84b7e |
hex | 430efbed |
1125055469 has 2 divisors, whose sum is σ = 1125055470. Its totient is φ = 1125055468.
The previous prime is 1125055439. The next prime is 1125055471. The reversal of 1125055469 is 9645505211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1118032969 + 7022500 = 33437^2 + 2650^2 .
It is a cyclic number.
It is not a de Polignac number, because 1125055469 - 28 = 1125055213 is a prime.
It is a super-2 number, since 2×11250554692 = 2531499616653619922, which contains 22 as substring.
Together with 1125055471, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1125055409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 562527734 + 562527735.
It is an arithmetic number, because the mean of its divisors is an integer number (562527735).
Almost surely, 21125055469 is an apocalyptic number.
It is an amenable number.
1125055469 is a deficient number, since it is larger than the sum of its proper divisors (1).
1125055469 is an equidigital number, since it uses as much as digits as its factorization.
1125055469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 38.
The square root of 1125055469 is about 33541.8465353355. The cubic root of 1125055469 is about 1040.0590046035.
The spelling of 1125055469 in words is "one billion, one hundred twenty-five million, fifty-five thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •