Base | Representation |
---|---|
bin | 100001110011111… |
… | …0010110101101001 |
3 | 2221001202211201121 |
4 | 1003213302311221 |
5 | 4310413132241 |
6 | 304324215241 |
7 | 40054064455 |
oct | 10347626551 |
9 | 2831684647 |
10 | 1134505321 |
11 | 532442704 |
12 | 277b3a521 |
13 | 151072531 |
14 | aa961665 |
15 | 698eead1 |
hex | 439f2d69 |
1134505321 has 2 divisors, whose sum is σ = 1134505322. Its totient is φ = 1134505320.
The previous prime is 1134505289. The next prime is 1134505343. The reversal of 1134505321 is 1235054311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1078794025 + 55711296 = 32845^2 + 7464^2 .
It is an emirp because it is prime and its reverse (1235054311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1134505321 - 25 = 1134505289 is a prime.
It is not a weakly prime, because it can be changed into another prime (1134505391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 567252660 + 567252661.
It is an arithmetic number, because the mean of its divisors is an integer number (567252661).
Almost surely, 21134505321 is an apocalyptic number.
It is an amenable number.
1134505321 is a deficient number, since it is larger than the sum of its proper divisors (1).
1134505321 is an equidigital number, since it uses as much as digits as its factorization.
1134505321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 1134505321 is about 33682.4185740870. The cubic root of 1134505321 is about 1042.9628654606.
Adding to 1134505321 its reverse (1235054311), we get a palindrome (2369559632).
The spelling of 1134505321 in words is "one billion, one hundred thirty-four million, five hundred five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •