Base | Representation |
---|---|
bin | 101000010011000… |
… | …1111100000000101 |
3 | 10111020101222202122 |
4 | 1100212033200011 |
5 | 10232130432440 |
6 | 342102215325 |
7 | 45336346412 |
oct | 12046174005 |
9 | 3436358678 |
10 | 1352202245 |
11 | 634312619 |
12 | 318a24545 |
13 | 1871b4894 |
14 | cb82d109 |
15 | 7daa27b5 |
hex | 5098f805 |
1352202245 has 8 divisors (see below), whose sum is σ = 1627294200. Its totient is φ = 1078660800.
The previous prime is 1352202217. The next prime is 1352202251. The reversal of 1352202245 is 5422022531.
It can be written as a sum of positive squares in 4 ways, for example, as 583415716 + 768786529 = 24154^2 + 27727^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1352202245 is a prime.
It is a super-3 number, since 3×13522022453 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 385706 + ... + 389195.
It is an arithmetic number, because the mean of its divisors is an integer number (203411775).
Almost surely, 21352202245 is an apocalyptic number.
It is an amenable number.
1352202245 is a deficient number, since it is larger than the sum of its proper divisors (275091955).
1352202245 is an equidigital number, since it uses as much as digits as its factorization.
1352202245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 775255.
The product of its (nonzero) digits is 4800, while the sum is 26.
The square root of 1352202245 is about 36772.3026883006. The cubic root of 1352202245 is about 1105.8100964296.
Adding to 1352202245 its reverse (5422022531), we get a palindrome (6774224776).
The spelling of 1352202245 in words is "one billion, three hundred fifty-two million, two hundred two thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •