Base | Representation |
---|---|
bin | 100110101100111001100011… |
… | …0001101100000110101100111 |
3 | 1122122100001210200200022002122 |
4 | 1031121303012031200311213 |
5 | 324104440120411441403 |
6 | 3204003523520300155 |
7 | 131463465150460112 |
oct | 11531630615406547 |
9 | 1578301720608078 |
10 | 340422433312103 |
11 | 995183858a034a |
12 | 3222019417165b |
13 | 117c490bb6588c |
14 | 600c76860b579 |
15 | 295527e646838 |
hex | 1359cc6360d67 |
340422433312103 has 8 divisors (see below), whose sum is σ = 360460279883088. Its totient is φ = 320386030913664.
The previous prime is 340422433312097. The next prime is 340422433312111. The reversal of 340422433312103 is 301213334224043.
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 340422433312103 - 28 = 340422433311847 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (340422433312163) 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, 360557801 + ... + 361500722.
It is an arithmetic number, because the mean of its divisors is an integer number (45057534985386).
Almost surely, 2340422433312103 is an apocalyptic number.
340422433312103 is a deficient number, since it is larger than the sum of its proper divisors (20037846570985).
340422433312103 is a wasteful number, since it uses less digits than its factorization.
340422433312103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 722086273.
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 340422433312103 its reverse (301213334224043), we get a palindrome (641635767536146).
The spelling of 340422433312103 in words is "three hundred forty trillion, four hundred twenty-two billion, four hundred thirty-three million, three hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •