Base | Representation |
---|---|
bin | 100010010100010… |
… | …1001001010011101 |
3 | 2222020202111222022 |
4 | 1010220221022131 |
5 | 4324241130203 |
6 | 310132425525 |
7 | 40351426406 |
oct | 10450511235 |
9 | 2866674868 |
10 | 1151505053 |
11 | 540aa3876 |
12 | 2817782a5 |
13 | 15474514a |
14 | acd089ad |
15 | 6b15ba38 |
hex | 44a2929d |
1151505053 has 4 divisors (see below), whose sum is σ = 1151961120. Its totient is φ = 1151048988.
The previous prime is 1151505023. The next prime is 1151505067. The reversal of 1151505053 is 3505051511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1151505053 - 218 = 1151242909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1151505023) 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, 224225 + ... + 229302.
It is an arithmetic number, because the mean of its divisors is an integer number (287990280).
Almost surely, 21151505053 is an apocalyptic number.
It is an amenable number.
1151505053 is a deficient number, since it is larger than the sum of its proper divisors (456067).
1151505053 is an equidigital number, since it uses as much as digits as its factorization.
1151505053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 456066.
The product of its (nonzero) digits is 1875, while the sum is 26.
The square root of 1151505053 is about 33933.8334557120. The cubic root of 1151505053 is about 1048.1464056116.
Adding to 1151505053 its reverse (3505051511), we get a palindrome (4656556564).
The spelling of 1151505053 in words is "one billion, one hundred fifty-one million, five hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •