Base | Representation |
---|---|
bin | 10011100011000101011… |
… | …100010100110100010011 |
3 | 11202102101211121002221021 |
4 | 103203011130110310103 |
5 | 134002131114130303 |
6 | 2505042320140311 |
7 | 166024163301013 |
oct | 23430534246423 |
9 | 4672354532837 |
10 | 1343342333203 |
11 | 4787877a9682 |
12 | 198422767697 |
13 | 998a4761850 |
14 | 490379d1c43 |
15 | 24e24072ebd |
hex | 138c5714d13 |
1343342333203 has 16 divisors (see below), whose sum is σ = 1456704539136. Its totient is φ = 1231434639360.
The previous prime is 1343342333183. The next prime is 1343342333213. The reversal of 1343342333203 is 3023332433431.
It is a cyclic number.
It is not a de Polignac number, because 1343342333203 - 213 = 1343342325011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1343342333213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1016251 + ... + 1928587.
It is an arithmetic number, because the mean of its divisors is an integer number (91044033696).
Almost surely, 21343342333203 is an apocalyptic number.
1343342333203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1343342333203 is a deficient number, since it is larger than the sum of its proper divisors (113362205933).
1343342333203 is a wasteful number, since it uses less digits than its factorization.
1343342333203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 913134.
The product of its (nonzero) digits is 139968, while the sum is 34.
Adding to 1343342333203 its reverse (3023332433431), we get a palindrome (4366674766634).
The spelling of 1343342333203 in words is "one trillion, three hundred forty-three billion, three hundred forty-two million, three hundred thirty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •