Base | Representation |
---|---|
bin | 100110101110001110101000… |
… | …0100011110100000000011111 |
3 | 1122122222112102001021011020221 |
4 | 1031130131100203310000133 |
5 | 324120433313104240111 |
6 | 3204223502000022211 |
7 | 131512623651520462 |
oct | 11534352043640037 |
9 | 1578875361234227 |
10 | 340605143040031 |
11 | 995889147631a1 |
12 | 3224b685301967 |
13 | 11808c08cbb61c |
14 | 601753c24d2d9 |
15 | 2959dc4ba7371 |
hex | 135c7508f401f |
340605143040031 has 2 divisors, whose sum is σ = 340605143040032. Its totient is φ = 340605143040030.
The previous prime is 340605143040023. The next prime is 340605143040073. The reversal of 340605143040031 is 130040341506043.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 340605143040031 - 23 = 340605143040023 is a prime.
It is a super-2 number, since 2×3406051430400312 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (340605143044031) by changing a digit.
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 as a sum of consecutive naturals, namely, 170302571520015 + 170302571520016.
It is an arithmetic number, because the mean of its divisors is an integer number (170302571520016).
Almost surely, 2340605143040031 is an apocalyptic number.
340605143040031 is a deficient number, since it is larger than the sum of its proper divisors (1).
340605143040031 is an equidigital number, since it uses as much as digits as its factorization.
340605143040031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 340605143040031 its reverse (130040341506043), we get a palindrome (470645484546074).
The spelling of 340605143040031 in words is "three hundred forty trillion, six hundred five billion, one hundred forty-three million, forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •