Base | Representation |
---|---|
bin | 1001111001111001101… |
… | …01110100001000010001 |
3 | 1012112102201001121121202 |
4 | 10330330311310020101 |
5 | 21033440212001442 |
6 | 420201534200545 |
7 | 33405345046352 |
oct | 4747465641021 |
9 | 1175381047552 |
10 | 340323156497 |
11 | 12136a605625 |
12 | 55b59653155 |
13 | 26127b2901c |
14 | 126865cdd29 |
15 | 8cbc72ac32 |
hex | 4f3cd74211 |
340323156497 has 2 divisors, whose sum is σ = 340323156498. Its totient is φ = 340323156496.
The previous prime is 340323156491. The next prime is 340323156533. The reversal of 340323156497 is 794651323043.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 281834636161 + 58488520336 = 530881^2 + 241844^2 .
It is an emirp because it is prime and its reverse (794651323043) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 340323156497 - 226 = 340256047633 is a prime.
It is a super-2 number, since 2×3403231564972 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (340323156491) 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 as a sum of consecutive naturals, namely, 170161578248 + 170161578249.
It is an arithmetic number, because the mean of its divisors is an integer number (170161578249).
Almost surely, 2340323156497 is an apocalyptic number.
It is an amenable number.
340323156497 is a deficient number, since it is larger than the sum of its proper divisors (1).
340323156497 is an equidigital number, since it uses as much as digits as its factorization.
340323156497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 47.
The spelling of 340323156497 in words is "three hundred forty billion, three hundred twenty-three million, one hundred fifty-six thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •