Base | Representation |
---|---|
bin | 100010010101010… |
… | …0111101100111101 |
3 | 2222021201211221202 |
4 | 1010222213230331 |
5 | 4324404221412 |
6 | 310151505245 |
7 | 40356015452 |
oct | 10452475475 |
9 | 2867654852 |
10 | 1152023357 |
11 | 541318221 |
12 | 281988225 |
13 | 154897034 |
14 | ad001829 |
15 | 6b2103c2 |
hex | 44aa7b3d |
1152023357 has 2 divisors, whose sum is σ = 1152023358. Its totient is φ = 1152023356.
The previous prime is 1152023291. The next prime is 1152023359. The reversal of 1152023357 is 7533202511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 967769881 + 184253476 = 31109^2 + 13574^2 .
It is a cyclic number.
It is not a de Polignac number, because 1152023357 - 218 = 1151761213 is a prime.
Together with 1152023359, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1152023359) 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, 576011678 + 576011679.
It is an arithmetic number, because the mean of its divisors is an integer number (576011679).
Almost surely, 21152023357 is an apocalyptic number.
It is an amenable number.
1152023357 is a deficient number, since it is larger than the sum of its proper divisors (1).
1152023357 is an equidigital number, since it uses as much as digits as its factorization.
1152023357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6300, while the sum is 29.
The square root of 1152023357 is about 33941.4695763162. The cubic root of 1152023357 is about 1048.3036424339.
Adding to 1152023357 its reverse (7533202511), we get a palindrome (8685225868).
The spelling of 1152023357 in words is "one billion, one hundred fifty-two million, twenty-three thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •