Base | Representation |
---|---|
bin | 10011100010000001110… |
… | …000000010011111100101 |
3 | 11202022110200121102221001 |
4 | 103202001300002133211 |
5 | 133442314400302331 |
6 | 2504333510353301 |
7 | 165654063200164 |
oct | 23420160023745 |
9 | 4668420542831 |
10 | 1342206650341 |
11 | 4782547322a7 |
12 | 19816635b831 |
13 | 9975339935b |
14 | 48d6ac453db |
15 | 24da94de561 |
hex | 13881c027e5 |
1342206650341 has 6 divisors (see below), whose sum is σ = 1425804296690. Its totient is φ = 1263253317696.
The previous prime is 1342206650333. The next prime is 1342206650381. The reversal of 1342206650341 is 1430566022431.
It can be written as a sum of positive squares in 3 ways, for example, as 728412747841 + 613793902500 = 853471^2 + 783450^2 .
It is not a de Polignac number, because 1342206650341 - 23 = 1342206650333 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1342206650341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1342206650381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2322156546 + ... + 2322157123.
Almost surely, 21342206650341 is an apocalyptic number.
It is an amenable number.
1342206650341 is a deficient number, since it is larger than the sum of its proper divisors (83597646349).
1342206650341 is an equidigital number, since it uses as much as digits as its factorization.
1342206650341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4644313703 (or 4644313686 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 37.
The spelling of 1342206650341 in words is "one trillion, three hundred forty-two billion, two hundred six million, six hundred fifty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •