Base | Representation |
---|---|
bin | 100010010011100… |
… | …0110010101011101 |
3 | 2222012222221200201 |
4 | 1010213012111131 |
5 | 4324140202003 |
6 | 310120023501 |
7 | 40345122262 |
oct | 10447062535 |
9 | 2865887621 |
10 | 1151100253 |
11 | 540847726 |
12 | 281601b91 |
13 | 154632b14 |
14 | acc41269 |
15 | 6b0cbb1d |
hex | 449c655d |
1151100253 has 2 divisors, whose sum is σ = 1151100254. Its totient is φ = 1151100252.
The previous prime is 1151100233. The next prime is 1151100259. The reversal of 1151100253 is 3520011511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 822657124 + 328443129 = 28682^2 + 18123^2 .
It is an emirp because it is prime and its reverse (3520011511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1151100253 - 25 = 1151100221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1151100253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1151100259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 575550126 + 575550127.
It is an arithmetic number, because the mean of its divisors is an integer number (575550127).
Almost surely, 21151100253 is an apocalyptic number.
It is an amenable number.
1151100253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1151100253 is an equidigital number, since it uses as much as digits as its factorization.
1151100253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 19.
The square root of 1151100253 is about 33927.8683827912. The cubic root of 1151100253 is about 1048.0235694469.
Adding to 1151100253 its reverse (3520011511), we get a palindrome (4671111764).
The spelling of 1151100253 in words is "one billion, one hundred fifty-one million, one hundred thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •