Base | Representation |
---|---|
bin | 100010010011111… |
… | …1110101011101101 |
3 | 2222020102200021212 |
4 | 1010213332223231 |
5 | 4324220043203 |
6 | 310125004205 |
7 | 40350103205 |
oct | 10447765355 |
9 | 2866380255 |
10 | 1151331053 |
11 | 540995074 |
12 | 2816b3665 |
13 | 1546b3ba2 |
14 | acca1405 |
15 | 6b1251d8 |
hex | 449feaed |
1151331053 has 2 divisors, whose sum is σ = 1151331054. Its totient is φ = 1151331052.
The previous prime is 1151331047. The next prime is 1151331091. The reversal of 1151331053 is 3501331511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 899220169 + 252110884 = 29987^2 + 15878^2 .
It is a cyclic number.
It is not a de Polignac number, because 1151331053 - 210 = 1151330029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1151321053) 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, 575665526 + 575665527.
It is an arithmetic number, because the mean of its divisors is an integer number (575665527).
Almost surely, 21151331053 is an apocalyptic number.
It is an amenable number.
1151331053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1151331053 is an equidigital number, since it uses as much as digits as its factorization.
1151331053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 675, while the sum is 23.
The square root of 1151331053 is about 33931.2695459513. The cubic root of 1151331053 is about 1048.0936090097.
Adding to 1151331053 its reverse (3501331511), we get a palindrome (4652662564).
The spelling of 1151331053 in words is "one billion, one hundred fifty-one million, three hundred thirty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •