Base | Representation |
---|---|
bin | 110111110010001101110011… |
… | …011011000110001100010101 |
3 | 1012011200121002010112200221201 |
4 | 313302031303123012030111 |
5 | 224124201141423120001 |
6 | 2225445102555512501 |
7 | 102451321003326424 |
oct | 6762156333061425 |
9 | 1164617063480851 |
10 | 245343353332501 |
11 | 711a0593960596 |
12 | 23625228758731 |
13 | a6b8a18465268 |
14 | 44829786952bb |
15 | 1d56e24c5d501 |
hex | df23736c6315 |
245343353332501 has 2 divisors, whose sum is σ = 245343353332502. Its totient is φ = 245343353332500.
The previous prime is 245343353332459. The next prime is 245343353332523. The reversal of 245343353332501 is 105233353343542.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 211566508446276 + 33776844886225 = 14545326^2 + 5811785^2 .
It is a cyclic number.
It is not a de Polignac number, because 245343353332501 - 221 = 245343351235349 is a prime.
It is a super-2 number, since 2×2453433533325012 (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 (245343353332541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122671676666250 + 122671676666251.
It is an arithmetic number, because the mean of its divisors is an integer number (122671676666251).
Almost surely, 2245343353332501 is an apocalyptic number.
It is an amenable number.
245343353332501 is a deficient number, since it is larger than the sum of its proper divisors (1).
245343353332501 is an equidigital number, since it uses as much as digits as its factorization.
245343353332501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832000, while the sum is 46.
The spelling of 245343353332501 in words is "two hundred forty-five trillion, three hundred forty-three billion, three hundred fifty-three million, three hundred thirty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •