Base | Representation |
---|---|
bin | 100001100010000… |
… | …0101101101001011 |
3 | 2220102011022100120 |
4 | 1003010011231023 |
5 | 4301014123134 |
6 | 303351434323 |
7 | 36611402226 |
oct | 10304055513 |
9 | 2812138316 |
10 | 1125145419 |
11 | 52812a452 |
12 | 2749859a3 |
13 | 14c146128 |
14 | a96065bd |
15 | 68ba1649 |
hex | 43105b4b |
1125145419 has 4 divisors (see below), whose sum is σ = 1500193896. Its totient is φ = 750096944.
The previous prime is 1125145397. The next prime is 1125145421. The reversal of 1125145419 is 9145415211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1125145419 - 228 = 856709963 is a prime.
It is a super-2 number, since 2×11251454192 = 2531904427793371122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1125145419.
It is not an unprimeable number, because it can be changed into a prime (1125145429) 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 3 ways as a sum of consecutive naturals, for example, 187524234 + ... + 187524239.
It is an arithmetic number, because the mean of its divisors is an integer number (375048474).
Almost surely, 21125145419 is an apocalyptic number.
1125145419 is a deficient number, since it is larger than the sum of its proper divisors (375048477).
1125145419 is an equidigital number, since it uses as much as digits as its factorization.
1125145419 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375048476.
The product of its digits is 7200, while the sum is 33.
The square root of 1125145419 is about 33543.1873709104. The cubic root of 1125145419 is about 1040.0867219967.
The spelling of 1125145419 in words is "one billion, one hundred twenty-five million, one hundred forty-five thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •