Base | Representation |
---|---|
bin | 110111110010001101110001… |
… | …011100010101101000010011 |
3 | 1012011200120222211000111020212 |
4 | 313302031301130111220103 |
5 | 224124201104421302233 |
6 | 2225445055411354335 |
7 | 102451320121021622 |
oct | 6762156134255023 |
9 | 1164616884014225 |
10 | 245343320103443 |
11 | 711a0577125061 |
12 | 236252195b29ab |
13 | a6b8a115cc5b3 |
14 | 44829740c56b9 |
15 | 1d56e21d97a48 |
hex | df2371715a13 |
245343320103443 has 2 divisors, whose sum is σ = 245343320103444. Its totient is φ = 245343320103442.
The previous prime is 245343320103347. The next prime is 245343320103467. The reversal of 245343320103443 is 344301023343542.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-245343320103443 is a prime.
It is a super-2 number, since 2×2453433201034432 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 245343320103443.
It is not a weakly prime, because it can be changed into another prime (245343320100443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122671660051721 + 122671660051722.
It is an arithmetic number, because the mean of its divisors is an integer number (122671660051722).
Almost surely, 2245343320103443 is an apocalyptic number.
245343320103443 is a deficient number, since it is larger than the sum of its proper divisors (1).
245343320103443 is an equidigital number, since it uses as much as digits as its factorization.
245343320103443 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1244160, while the sum is 41.
Adding to 245343320103443 its reverse (344301023343542), we get a palindrome (589644343446985).
The spelling of 245343320103443 in words is "two hundred forty-five trillion, three hundred forty-three billion, three hundred twenty million, one hundred three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •