Base | Representation |
---|---|
bin | 100101010110101… |
… | …1000110111110001 |
3 | 10020100111221111011 |
4 | 1022231120313301 |
5 | 10031333143322 |
6 | 324212550521 |
7 | 43026554242 |
oct | 11255306761 |
9 | 3210457434 |
10 | 1253412337 |
11 | 593578271 |
12 | 2ab922441 |
13 | 16c8a5b08 |
14 | bc674cc9 |
15 | 7508b677 |
hex | 4ab58df1 |
1253412337 has 2 divisors, whose sum is σ = 1253412338. Its totient is φ = 1253412336.
The previous prime is 1253412269. The next prime is 1253412371. The reversal of 1253412337 is 7332143521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1106493696 + 146918641 = 33264^2 + 12121^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1253412337 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1253412299 and 1253412308.
It is not a weakly prime, because it can be changed into another prime (1253418337) 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, 626706168 + 626706169.
It is an arithmetic number, because the mean of its divisors is an integer number (626706169).
Almost surely, 21253412337 is an apocalyptic number.
It is an amenable number.
1253412337 is a deficient number, since it is larger than the sum of its proper divisors (1).
1253412337 is an equidigital number, since it uses as much as digits as its factorization.
1253412337 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15120, while the sum is 31.
The square root of 1253412337 is about 35403.5639025226. The cubic root of 1253412337 is about 1078.1966753687.
Adding to 1253412337 its reverse (7332143521), we get a palindrome (8585555858).
The spelling of 1253412337 in words is "one billion, two hundred fifty-three million, four hundred twelve thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •