Base | Representation |
---|---|
bin | 100100101101111… |
… | …0000010001000101 |
3 | 10011212020201020022 |
4 | 1021123300101011 |
5 | 10010343343412 |
6 | 322130144525 |
7 | 42346634522 |
oct | 11133602105 |
9 | 3155221208 |
10 | 1232012357 |
11 | 582491134 |
12 | 2a4722145 |
13 | 1683223c4 |
14 | b98a4149 |
15 | 73260a72 |
hex | 496f0445 |
1232012357 has 2 divisors, whose sum is σ = 1232012358. Its totient is φ = 1232012356.
The previous prime is 1232012333. The next prime is 1232012359. The reversal of 1232012357 is 7532102321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1177931041 + 54081316 = 34321^2 + 7354^2 .
It is a cyclic number.
It is not a de Polignac number, because 1232012357 - 28 = 1232012101 is a prime.
Together with 1232012359, 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 (1232012359) 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 as a sum of consecutive naturals, namely, 616006178 + 616006179.
It is an arithmetic number, because the mean of its divisors is an integer number (616006179).
Almost surely, 21232012357 is an apocalyptic number.
It is an amenable number.
1232012357 is a deficient number, since it is larger than the sum of its proper divisors (1).
1232012357 is an equidigital number, since it uses as much as digits as its factorization.
1232012357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 1232012357 is about 35100.0335754825. The cubic root of 1232012357 is about 1072.0252663185.
Adding to 1232012357 its reverse (7532102321), we get a palindrome (8764114678).
The spelling of 1232012357 in words is "one billion, two hundred thirty-two million, twelve thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •