Base | Representation |
---|---|
bin | 100001010110111011111010… |
… | …0100010000010011100001101 |
3 | 1102110221000001002101221022121 |
4 | 1002231313310202002130031 |
5 | 301424422042112340204 |
6 | 2520020501424412541 |
7 | 115543065655210231 |
oct | 10255676442023415 |
9 | 1373830032357277 |
10 | 293423383324429 |
11 | 8554818139a296 |
12 | 28aab501477151 |
13 | c795924a2a087 |
14 | 5265aa61545c1 |
15 | 23dc937835b54 |
hex | 10addf488270d |
293423383324429 has 2 divisors, whose sum is σ = 293423383324430. Its totient is φ = 293423383324428.
The previous prime is 293423383324369. The next prime is 293423383324469. The reversal of 293423383324429 is 924423383324392.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 292671517446025 + 751865878404 = 17107645^2 + 867102^2 .
It is a cyclic number.
It is not a de Polignac number, because 293423383324429 - 27 = 293423383324301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (293423383324469) 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, 146711691662214 + 146711691662215.
It is an arithmetic number, because the mean of its divisors is an integer number (146711691662215).
Almost surely, 2293423383324429 is an apocalyptic number.
It is an amenable number.
293423383324429 is a deficient number, since it is larger than the sum of its proper divisors (1).
293423383324429 is an equidigital number, since it uses as much as digits as its factorization.
293423383324429 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 161243136, while the sum is 61.
The spelling of 293423383324429 in words is "two hundred ninety-three trillion, four hundred twenty-three billion, three hundred eighty-three million, three hundred twenty-four thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •