Base | Representation |
---|---|
bin | 10010000101101011101… |
… | …100010011100111101001 |
3 | 11101211112110020211201002 |
4 | 102011223230103213221 |
5 | 130331232343402403 |
6 | 2351014513204345 |
7 | 155543665300406 |
oct | 22055354234751 |
9 | 4354473224632 |
10 | 1243052325353 |
11 | 43a1a26a4373 |
12 | 180ab38606b5 |
13 | 902b0b42437 |
14 | 4424223d2ad |
15 | 22504650188 |
hex | 1216bb139e9 |
1243052325353 has 8 divisors (see below), whose sum is σ = 1263572094216. Its totient is φ = 1222537132800.
The previous prime is 1243052325313. The next prime is 1243052325397. The reversal of 1243052325353 is 3535232503421.
It can be written as a sum of positive squares in 4 ways, for example, as 57538576384 + 1185513748969 = 239872^2 + 1088813^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 1243052325353 - 210 = 1243052324329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1243052325313) 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, 594176 + ... + 1684977.
It is an arithmetic number, because the mean of its divisors is an integer number (157946511777).
Almost surely, 21243052325353 is an apocalyptic number.
It is an amenable number.
1243052325353 is a deficient number, since it is larger than the sum of its proper divisors (20519768863).
1243052325353 is an equidigital number, since it uses as much as digits as its factorization.
1243052325353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2288155.
The product of its (nonzero) digits is 324000, while the sum is 38.
Adding to 1243052325353 its reverse (3535232503421), we get a palindrome (4778284828774).
The spelling of 1243052325353 in words is "one trillion, two hundred forty-three billion, fifty-two million, three hundred twenty-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •