Base | Representation |
---|---|
bin | 1001111001011111010… |
… | …11011001010001001111 |
3 | 1012111212022112000120211 |
4 | 10330233223121101033 |
5 | 21033012143234411 |
6 | 420124005023251 |
7 | 33400024013641 |
oct | 4745753312117 |
9 | 1174768460524 |
10 | 340102321231 |
11 | 121266991842 |
12 | 55ab76b4b27 |
13 | 260c115837a |
14 | 12665146891 |
15 | 8ca8158221 |
hex | 4f2fad944f |
340102321231 has 2 divisors, whose sum is σ = 340102321232. Its totient is φ = 340102321230.
The previous prime is 340102321193. The next prime is 340102321253. The reversal of 340102321231 is 132123201043.
It is an a-pointer prime, because the next prime (340102321253) can be obtained adding 340102321231 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 340102321231 - 213 = 340102313039 is a prime.
It is a super-2 number, since 2×3401023212312 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (340102321261) 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, 170051160615 + 170051160616.
It is an arithmetic number, because the mean of its divisors is an integer number (170051160616).
Almost surely, 2340102321231 is an apocalyptic number.
340102321231 is a deficient number, since it is larger than the sum of its proper divisors (1).
340102321231 is an equidigital number, since it uses as much as digits as its factorization.
340102321231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 340102321231 its reverse (132123201043), we get a palindrome (472225522274).
The spelling of 340102321231 in words is "three hundred forty billion, one hundred two million, three hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •