Base | Representation |
---|---|
bin | 10011100010000011111… |
… | …011100011011100011001 |
3 | 11202022120020102112121212 |
4 | 103202003323203130121 |
5 | 133442403231121241 |
6 | 2504341254312505 |
7 | 165655016103020 |
oct | 23420373433431 |
9 | 4668506375555 |
10 | 1342243223321 |
11 | 478273342100 |
12 | 198176658735 |
13 | 9975ab33080 |
14 | 48d71a458b7 |
15 | 24dac815beb |
hex | 13883ee3719 |
1342243223321 has 96 divisors (see below), whose sum is σ = 1830420480000. Its totient is φ = 957720931200.
The previous prime is 1342243223317. The next prime is 1342243223323. The reversal of 1342243223321 is 1233223422431.
It is not a de Polignac number, because 1342243223321 - 22 = 1342243223317 is a prime.
It is a super-2 number, since 2×13422432233212 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1342243223323) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1049446760 + ... + 1049448038.
It is an arithmetic number, because the mean of its divisors is an integer number (19066880000).
Almost surely, 21342243223321 is an apocalyptic number.
1342243223321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1342243223321 is a deficient number, since it is larger than the sum of its proper divisors (488177256679).
1342243223321 is a wasteful number, since it uses less digits than its factorization.
1342243223321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011 (or 2000 counting only the distinct ones).
The product of its digits is 41472, while the sum is 32.
Adding to 1342243223321 its reverse (1233223422431), we get a palindrome (2575466645752).
The spelling of 1342243223321 in words is "one trillion, three hundred forty-two billion, two hundred forty-three million, two hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •