Base | Representation |
---|---|
bin | 1001111001100011010… |
… | …01000001001000110011 |
3 | 1012111221121111002211121 |
4 | 10330301221001020303 |
5 | 21033044111040111 |
6 | 420131142523111 |
7 | 33400603641364 |
oct | 4746151011063 |
9 | 1174847432747 |
10 | 340135252531 |
11 | 121283534598 |
12 | 55b06736497 |
13 | 260c7c18649 |
14 | 12669679b6b |
15 | 8caaeb0871 |
hex | 4f31a41233 |
340135252531 has 4 divisors (see below), whose sum is σ = 349328097232. Its totient is φ = 330942407832.
The previous prime is 340135252511. The next prime is 340135252537. The reversal of 340135252531 is 135252531043.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 340135252531 - 215 = 340135219763 is a prime.
It is a super-2 number, since 2×3401352525312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (340135252537) 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, 4596422295 + ... + 4596422368.
It is an arithmetic number, because the mean of its divisors is an integer number (87332024308).
Almost surely, 2340135252531 is an apocalyptic number.
340135252531 is a deficient number, since it is larger than the sum of its proper divisors (9192844701).
340135252531 is an equidigital number, since it uses as much as digits as its factorization.
340135252531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9192844700.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 340135252531 its reverse (135252531043), we get a palindrome (475387783574).
The spelling of 340135252531 in words is "three hundred forty billion, one hundred thirty-five million, two hundred fifty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •