Base | Representation |
---|---|
bin | 1001111001010110110… |
… | …01011011110001001111 |
3 | 1012111200022101022212221 |
4 | 10330223121123301033 |
5 | 21032340302112030 |
6 | 420112521440211 |
7 | 33365162411206 |
oct | 4745331336117 |
9 | 1174608338787 |
10 | 340030504015 |
11 | 12122a39a474 |
12 | 55a97640067 |
13 | 260ac301687 |
14 | 126597b023d |
15 | 8ca1bbde7a |
hex | 4f2b65bc4f |
340030504015 has 8 divisors (see below), whose sum is σ = 408097211760. Its totient is φ = 271983998592.
The previous prime is 340030504003. The next prime is 340030504027. The reversal of 340030504015 is 510405030043.
It is an interprime number because it is at equal distance from previous prime (340030504003) and next prime (340030504027).
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 340030504015 - 29 = 340030503503 is a prime.
It is a super-2 number, since 2×3400305040152 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5013525 + ... + 5080894.
It is an arithmetic number, because the mean of its divisors is an integer number (51012151470).
Almost surely, 2340030504015 is an apocalyptic number.
340030504015 is a deficient number, since it is larger than the sum of its proper divisors (68066707745).
340030504015 is a wasteful number, since it uses less digits than its factorization.
340030504015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10101161.
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 340030504015 its reverse (510405030043), we get a palindrome (850435534058).
The spelling of 340030504015 in words is "three hundred forty billion, thirty million, five hundred four thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •