Base | Representation |
---|---|
bin | 100111011100000… |
… | …1010010010011101 |
3 | 10102020002220010202 |
4 | 1032320022102131 |
5 | 10202234020203 |
6 | 335151513245 |
7 | 44536150562 |
oct | 11670122235 |
9 | 3366086122 |
10 | 1323345053 |
11 | 619aa27a8 |
12 | 30b228825 |
13 | 18121cb14 |
14 | c7a7a869 |
15 | 7b2a2388 |
hex | 4ee0a49d |
1323345053 has 8 divisors (see below), whose sum is σ = 1329852216. Its totient is φ = 1316851200.
The previous prime is 1323345011. The next prime is 1323345083. The reversal of 1323345053 is 3505433231.
It can be written as a sum of positive squares in 4 ways, for example, as 12687844 + 1310657209 = 3562^2 + 36203^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1323345053 - 212 = 1323340957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323345083) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 236933 + ... + 242453.
It is an arithmetic number, because the mean of its divisors is an integer number (166231527).
Almost surely, 21323345053 is an apocalyptic number.
It is an amenable number.
1323345053 is a deficient number, since it is larger than the sum of its proper divisors (6507163).
1323345053 is an equidigital number, since it uses as much as digits as its factorization.
1323345053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6655.
The product of its (nonzero) digits is 16200, while the sum is 29.
The square root of 1323345053 is about 36377.8098983432. The cubic root of 1323345053 is about 1097.8871434421.
Adding to 1323345053 its reverse (3505433231), we get a palindrome (4828778284).
The spelling of 1323345053 in words is "one billion, three hundred twenty-three million, three hundred forty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •