Base | Representation |
---|---|
bin | 100110101001111001100110… |
… | …1101001001010101010100101 |
3 | 1122120212122212022101111010102 |
4 | 1031103303031221022222211 |
5 | 324031211433213011123 |
6 | 3203050314243433445 |
7 | 131421633512024003 |
oct | 11523631551125245 |
9 | 1576778768344112 |
10 | 340010241141413 |
11 | 99379596091727 |
12 | 32174319985885 |
13 | 11794a9c61a26b |
14 | 5dd68250c5a73 |
15 | 29496a76bd028 |
hex | 1353ccda4aaa5 |
340010241141413 has 8 divisors (see below), whose sum is σ = 341535963820800. Its totient is φ = 338484527507808.
The previous prime is 340010241141391. The next prime is 340010241141437. The reversal of 340010241141413 is 314141142010043.
It is a happy number.
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 340010241141413 - 210 = 340010241140389 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 (340010241341413) 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, 79738358 + ... + 83894136.
It is an arithmetic number, because the mean of its divisors is an integer number (42691995477600).
Almost surely, 2340010241141413 is an apocalyptic number.
It is an amenable number.
340010241141413 is a deficient number, since it is larger than the sum of its proper divisors (1525722679387).
340010241141413 is a wasteful number, since it uses less digits than its factorization.
340010241141413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4522891.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 340010241141413 its reverse (314141142010043), we get a palindrome (654151383151456).
The spelling of 340010241141413 in words is "three hundred forty trillion, ten billion, two hundred forty-one million, one hundred forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •