Base | Representation |
---|---|
bin | 100111011011010… |
… | …1110010010111101 |
3 | 10102012101202021012 |
4 | 1032312232102331 |
5 | 10202134441003 |
6 | 335135445005 |
7 | 44533021205 |
oct | 11666562275 |
9 | 3365352235 |
10 | 1322968253 |
11 | 6198656a2 |
12 | 30b086765 |
13 | 18111a469 |
14 | c79bd405 |
15 | 7b22a8d8 |
hex | 4edae4bd |
1322968253 has 2 divisors, whose sum is σ = 1322968254. Its totient is φ = 1322968252.
The previous prime is 1322968243. The next prime is 1322968331. The reversal of 1322968253 is 3528692231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 837118489 + 485849764 = 28933^2 + 22042^2 .
It is a cyclic number.
It is not a de Polignac number, because 1322968253 - 210 = 1322967229 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1322968253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1322968243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661484126 + 661484127.
It is an arithmetic number, because the mean of its divisors is an integer number (661484127).
Almost surely, 21322968253 is an apocalyptic number.
It is an amenable number.
1322968253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1322968253 is an equidigital number, since it uses as much as digits as its factorization.
1322968253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 155520, while the sum is 41.
The square root of 1322968253 is about 36372.6305482570. The cubic root of 1322968253 is about 1097.7829319859.
The spelling of 1322968253 in words is "one billion, three hundred twenty-two million, nine hundred sixty-eight thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •