Base | Representation |
---|---|
bin | 111110001111110… |
… | …110010111101101 |
3 | 2200210010002020201 |
4 | 332033312113231 |
5 | 4114322423003 |
6 | 251343513501 |
7 | 34610522413 |
oct | 7617662755 |
9 | 2623102221 |
10 | 1044342253 |
11 | 49655a879 |
12 | 2518b8891 |
13 | 1384942c6 |
14 | 9c9b12b3 |
15 | 61a3eb1d |
hex | 3e3f65ed |
1044342253 has 2 divisors, whose sum is σ = 1044342254. Its totient is φ = 1044342252.
The previous prime is 1044342251. The next prime is 1044342289. The reversal of 1044342253 is 3522434401.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 567487684 + 476854569 = 23822^2 + 21837^2 .
It is a cyclic number.
It is not a de Polignac number, because 1044342253 - 21 = 1044342251 is a prime.
It is a super-2 number, since 2×10443422532 = 2181301482802232018, which contains 22 as substring.
Together with 1044342251, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1044342251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 522171126 + 522171127.
It is an arithmetic number, because the mean of its divisors is an integer number (522171127).
Almost surely, 21044342253 is an apocalyptic number.
It is an amenable number.
1044342253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1044342253 is an equidigital number, since it uses as much as digits as its factorization.
1044342253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 28.
The square root of 1044342253 is about 32316.2846410289. The cubic root of 1044342253 is about 1014.5675082357.
Adding to 1044342253 its reverse (3522434401), we get a palindrome (4566776654).
The spelling of 1044342253 in words is "one billion, forty-four million, three hundred forty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •