Base | Representation |
---|---|
bin | 100010010011100… |
… | …1100001001001101 |
3 | 2222020001011022220 |
4 | 1010213030021031 |
5 | 4324141432140 |
6 | 310120325553 |
7 | 40345251531 |
oct | 10447141115 |
9 | 2866034286 |
10 | 1151124045 |
11 | 540863595 |
12 | 2816138b9 |
13 | 1546408b6 |
14 | acc49bc1 |
15 | 6b0d3bd0 |
hex | 449cc24d |
1151124045 has 8 divisors (see below), whose sum is σ = 1841798496. Its totient is φ = 613932816.
The previous prime is 1151124019. The next prime is 1151124049. The reversal of 1151124045 is 5404211511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1151124045 - 27 = 1151123917 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1151124049) 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, 38370787 + ... + 38370816.
It is an arithmetic number, because the mean of its divisors is an integer number (230224812).
Almost surely, 21151124045 is an apocalyptic number.
1151124045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1151124045 is a deficient number, since it is larger than the sum of its proper divisors (690674451).
1151124045 is an equidigital number, since it uses as much as digits as its factorization.
1151124045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76741611.
The product of its (nonzero) digits is 800, while the sum is 24.
The square root of 1151124045 is about 33928.2190071922. The cubic root of 1151124045 is about 1048.0307899026.
Adding to 1151124045 its reverse (5404211511), we get a palindrome (6555335556).
The spelling of 1151124045 in words is "one billion, one hundred fifty-one million, one hundred twenty-four thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •