Base | Representation |
---|---|
bin | 1001111001011111010… |
… | …00010010000011011001 |
3 | 1012111212020222120020222 |
4 | 10330233220102003121 |
5 | 21033011441131431 |
6 | 420123535325425 |
7 | 33400014044651 |
oct | 4745750220331 |
9 | 1174766876228 |
10 | 340101505241 |
11 | 121266484773 |
12 | 55ab7380875 |
13 | 260c0c30b34 |
14 | 12664db3361 |
15 | 8ca804657b |
hex | 4f2fa120d9 |
340101505241 has 8 divisors (see below), whose sum is σ = 357441685440. Its totient is φ = 322974088272.
The previous prime is 340101505193. The next prime is 340101505259. The reversal of 340101505241 is 142505101043.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-340101505241 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 340101505241.
It is not an unprimeable number, because it can be changed into a prime (340101505441) 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 7 ways as a sum of consecutive naturals, for example, 53187530 + ... + 53193923.
It is an arithmetic number, because the mean of its divisors is an integer number (44680210680).
Almost surely, 2340101505241 is an apocalyptic number.
It is an amenable number.
340101505241 is a deficient number, since it is larger than the sum of its proper divisors (17340180199).
340101505241 is a wasteful number, since it uses less digits than its factorization.
340101505241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106381615.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 340101505241 its reverse (142505101043), we get a palindrome (482606606284).
The spelling of 340101505241 in words is "three hundred forty billion, one hundred one million, five hundred five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •