Base | Representation |
---|---|
bin | 110001100001001011… |
… | …1000000011111101001 |
3 | 101011111000112001101021 |
4 | 1203002113000133221 |
5 | 3220241021320340 |
6 | 120504003452441 |
7 | 10453130211220 |
oct | 1430227003751 |
9 | 334430461337 |
10 | 106340026345 |
11 | 4110a1997a3 |
12 | 18739087121 |
13 | a04917bb17 |
14 | 520b0a1cb7 |
15 | 2b75b3ae4a |
hex | 18c25c07e9 |
106340026345 has 16 divisors (see below), whose sum is σ = 145869183360. Its totient is φ = 72903158784.
The previous prime is 106340026333. The next prime is 106340026349. The reversal of 106340026345 is 543620043601.
It is a cyclic number.
It is not a de Polignac number, because 106340026345 - 25 = 106340026313 is a prime.
It is a super-2 number, since 2×1063400263452 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106340026345.
It is not an unprimeable number, because it can be changed into a prime (106340026349) 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 15 ways as a sum of consecutive naturals, for example, 161535 + ... + 488644.
It is an arithmetic number, because the mean of its divisors is an integer number (9116823960).
Almost surely, 2106340026345 is an apocalyptic number.
It is an amenable number.
106340026345 is a deficient number, since it is larger than the sum of its proper divisors (39529157015).
106340026345 is an equidigital number, since it uses as much as digits as its factorization.
106340026345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654864.
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 106340026345 its reverse (543620043601), we get a palindrome (649960069946).
The spelling of 106340026345 in words is "one hundred six billion, three hundred forty million, twenty-six thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •