Base | Representation |
---|---|
bin | 1010000001011000101… |
… | …00101110101001100110 |
3 | 1012220210201100222112012 |
4 | 11000230110232221212 |
5 | 21120202244441032 |
6 | 422104342554222 |
7 | 33610043223065 |
oct | 5005424565146 |
9 | 1186721328465 |
10 | 344341015142 |
11 | 123041587263 |
12 | 5689b138972 |
13 | 26618361287 |
14 | 129480721dc |
15 | 8e5532c6b2 |
hex | 502c52ea66 |
344341015142 has 8 divisors (see below), whose sum is σ = 533173184832. Its totient is φ = 166616620200.
The previous prime is 344341015141. The next prime is 344341015147. The reversal of 344341015142 is 241510143443.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×3443410151423 (a number of 36 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 344341015099 and 344341015108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (344341015141) 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 3 ways as a sum of consecutive naturals, for example, 2776943609 + ... + 2776943732.
It is an arithmetic number, because the mean of its divisors is an integer number (66646648104).
Almost surely, 2344341015142 is an apocalyptic number.
344341015142 is a deficient number, since it is larger than the sum of its proper divisors (188832169690).
344341015142 is a wasteful number, since it uses less digits than its factorization.
344341015142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5553887374.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 344341015142 its reverse (241510143443), we get a palindrome (585851158585).
The spelling of 344341015142 in words is "three hundred forty-four billion, three hundred forty-one million, fifteen thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •