Base | Representation |
---|---|
bin | 10011100010000111010… |
… | …100111111111100100001 |
3 | 11202022201012200112122202 |
4 | 103202013110333330201 |
5 | 133443012324202223 |
6 | 2504351052142545 |
7 | 165656310442415 |
oct | 23420724777441 |
9 | 4668635615582 |
10 | 1342300225313 |
11 | 4782a2535593 |
12 | 198191767a55 |
13 | 997698a0568 |
14 | 48d79442d45 |
15 | 24db2825428 |
hex | 1388753ff21 |
1342300225313 has 4 divisors (see below), whose sum is σ = 1342306637700. Its totient is φ = 1342293812928.
The previous prime is 1342300225297. The next prime is 1342300225319. The reversal of 1342300225313 is 3135220032431.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 187378168384 + 1154922056929 = 432872^2 + 1074673^2 .
It is a cyclic number.
It is not a de Polignac number, because 1342300225313 - 24 = 1342300225297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1342300225319) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2881220 + ... + 3314517.
It is an arithmetic number, because the mean of its divisors is an integer number (335576659425).
Almost surely, 21342300225313 is an apocalyptic number.
It is an amenable number.
1342300225313 is a deficient number, since it is larger than the sum of its proper divisors (6412387).
1342300225313 is an equidigital number, since it uses as much as digits as its factorization.
1342300225313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6412386.
The product of its (nonzero) digits is 12960, while the sum is 29.
Adding to 1342300225313 its reverse (3135220032431), we get a palindrome (4477520257744).
The spelling of 1342300225313 in words is "one trillion, three hundred forty-two billion, three hundred million, two hundred twenty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.359 sec. • engine limits •